IDEAS home Printed from https://ideas.repec.org/p/cla/levarc/814577000000000178.html

A Foundation for Markov Equilibria in Infinite Horizon Perfect Information Games

Author

Listed:
  • V. Bhaskar
  • George J. Mailathy
  • Stephen Morris

Abstract

We study perfect information games with an infinite horizon played by an arbitrary number of players. This class of games includes infinitely repeated perfect information games, repeated games with asynchronous moves, games with long and short run players, games with overlapping generations of players, and canonical non-cooperative models of bargaining. We consider two restrictions on equilibria. An equilibrium is purifiable if close by behavior is consistent with equilibrium when agents' payoffs at each node are perturbed additively and independently. An equilibrium has bounded recall if there exists K such that at most one player's strategy depends on what happened more than K periods earlier. We show that only Markov equilibria have bounded memory and are purifiable. Thus if a game has at most one long-run player, all purifiable equilibria are Markov.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • V. Bhaskar & George J. Mailathy & Stephen Morris, 2009. "A Foundation for Markov Equilibria in Infinite Horizon Perfect Information Games," Levine's Working Paper Archive 814577000000000178, David K. Levine.
    • Handle: RePEc:cla:levarc:814577000000000178
    as

    Download full text from publisher

    File URL: http://www.dklevine.com/archive/refs4814577000000000178.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hannu Salonen & Hannu Vartiainen, 2011. "On the Existence of Markov Perfect Equilibria in Perfect Information Games," Discussion Papers 68, Aboa Centre for Economics.
    2. Sperisen, Benjamin, 2018. "Bounded memory and incomplete information," Games and Economic Behavior, Elsevier, vol. 109(C), pages 382-400.
    3. P. Jean-Jacques Herings & Harold Houba, 2010. "The Condorcet Paradox Revisited," Tinbergen Institute Discussion Papers 10-026/1, Tinbergen Institute.
    4. Doraszelski, Ulrich & Escobar, Juan F., 2019. "Protocol invariance and the timing of decisions in dynamic games," Theoretical Economics, Econometric Society, vol. 14(2), May.
    5. Can, Burak, 2014. "Weighted distances between preferences," Journal of Mathematical Economics, Elsevier, vol. 51(C), pages 109-115.
    6. de Roos, Nicolas & Matros, Alexander & Smirnov, Vladimir & Wait, Andrew, 2018. "Shipwrecks and treasure hunters," Journal of Economic Dynamics and Control, Elsevier, vol. 90(C), pages 259-283.
    7. Marina Azzimonti, 2011. "Barriers to Investment in Polarized Societies," American Economic Review, American Economic Association, vol. 101(5), pages 2182-2204, August.
    8. Matros, Alexander & Smirnov, Vladimir, 2016. "Duplicative search," Games and Economic Behavior, Elsevier, vol. 99(C), pages 1-22.

    More about this item

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cla:levarc:814577000000000178. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: David K. Levine (email available below). General contact details of provider: http://www.dklevine.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.