Asynchronous Choice in Repeated Coordination Games
The standard model of repeated games assumes perfect synchronization in the timing of decisions between the players. In many natural settings, however, choices are made synchronously so that only one player can move at a given time. This paper studies a family of repeated settings in which choices are asynchronous. Initially, we examine, as a canonical model, a simple two person alternating move game of pure coordination. There, it is shown that for sufficient patient players, there is a unique perfect equilibrium payoff which Pareto dominates all other payoffs. The result generalizes to any finite number of players and any game in a class of asynchronously repeated games which includes both stochastic and deterministic repetition. The result complement a recent Folk Theorem by Dutta (1995) for stochastic games which can be applied to asynchronously repeated games if a full dimensionality condition holds. A critical feature of the model is the inertia in decisions. We show how the inertia in asynchronous decisions determines the set of equilibrium payoffs.
(This abstract was borrowed from another version of this item.)
When requesting a correction, please mention this item's handle: RePEc:cla:penntw:23a1aa461811b8f48b0334f6ef68da9c. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (David K. Levine)
If references are entirely missing, you can add them using this form.