In Poisson games, an extension of perfect equilibrium based on perturbations of the strategy space does not guarantee that players use admissible actions. This observation suggests that such a class of perturbations is not the correct one. We characterize the right space of perturbations to...

In Poisson games, an extension of perfect equilibrium based on perturbations of the strategy space does not guarantee that players use admissible actions. This observation suggests that such a class of perturbations is not the correct one. We characterize the right space of perturbations to...

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...

This paper examines the question of the extent to which it is true that any equilibrium that is quasi-perfect in any extensive form game having a given normal form is necessarily proper. If one fixes not only the equilibrium in question but also a a sequence of completely mixed strategies...

Suppose that individual payoffs depend on the network connecting them. Consider the following simultaneous move game of network formation: players announce independently the links they wish to form, and links are formed only under mutual consent. We provide necessary and sufficient conditions on...

We show, that Strategy profile of a normal form game is proper if and only if it is quasiperfect in every extensive form (with that normal form). Thus, properness requires optimality along a sequence of suppol ting trembles, while sequentiality only requires optimality in the limit. A...