This paper is a self-contained survey of algorithms for computing Nash equilibria of two-person games. The games may be given in strategic form or extensive form. The classical Lemke-Howson algorithm finds one equilibrium of a bimatrix game, and provides an elementary proof that a Nash...

In many situations, such as trade in stock exchanges, agents have many instances to act even though the duration of interactions take a relatively short time. The agents in such situations can often coordinate their actions in advance, but coordination during the game consumes too much time. An...

We construct a fully specified extensive form game that captures competitive markets with adverse selection. In particular, it allows firms to offer any finite set of contracts, so that cross-subsidization is not ruled out. Moreover, firms can withdraw from the market after initial contract...