A refinement of the set of Nash equilibria that satisfies two assumptions is shown to select a subset that is stable in the sense defined by Kohlberg and Mertens. One assumption requires that a selected set is invariant to adjoining redundant strategies and the other is a strong version of...

This paper studies a dynamic adjustment process in a large society of forward-looking agents where payoffs are given by a normal form supermodular game. The stationary states of the dynamics correspond to the Nash equilibria of the stage game. It is shown that if the stage game has a monotone...

A population of agents recurrently plays a two-strategy population game. When an agent receives a revision opportunity, he chooses a new strategy using a noisy best response rule that satisfies mild regularity conditions; best response with mutations, logit choice, and probit choice are all...

We study games endowed with a pre-play phase in which players prepare the actions that will be implemented at a predetermined deadline. In the preparation phase, each player stochastically receives opportunities to revise her actions, and the finally-revised action is taken at the deadline. In...

We consider a model of evolution in games in which a revising agent observes the actions of a random number of randomly sampled opponents and then chooses a best response to the distribution of actions in the sample. We provide a condition on the distribution of sample sizes under which an...

We characterize the complete set of equilibrium allocations to an intrinsic common agency screening game as the set of solutions to self-generating optimization programs. We provide a complete characterization of equilibrium outcomes for regular environments by relying on techniques developed...

We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash...

This paper extends Milgrom and Robert's treatment of supermodular games in two ways. It points out that their main characterization result holds under a weaker assumption. It refines the arguments to provide bounds on the set of strategies that survive iterated deletion of weakly dominated...

A population of agents recurrently plays a two-strategy population game. When an agent receives a revision opportunity, he chooses a new strategy using a noisy best response rule that satisfies mild regularity conditions; best response with mutations, logit choice, and probit choice are all...

We study games endowed with a pre-play phase in which players prepare the actions that will be implemented at a predetermined deadline. In the preparation phase, each player stochastically receives opportunities to revise her actions, and the finally-revised action is taken at the deadline. In...