Markov Perfect equilibria in repeated asynchronous choice games

This paper examines the issue of multiplicity of Markov Perfect equilibria in alternating move repeated games. Such games are canonical models of environments with repeated, asynchronous choices due to inertia or replacement. Our main result is that the number of Markov Perfect equilibria is generically finite with respect to stage game payoffs. This holds despite the fact that the stochastic game representation of the alternating move repeated game is “non-generic” in the larger space of state dependent payoffs. We further obtain that the set of completely mixed Markov Perfect equilibria is generically empty with respect to stage game payoffs.