IDEAS home Printed from https://ideas.repec.org/a/oup/restud/v80y2013i3p925-948.html

A Foundation for Markov Equilibria in Sequential Games with Finite Social Memory -super-

Author

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

Abstract

We study stochastic games with an infinite horizon and sequential moves played by an arbitrary number of players. We assume that social memory is finite--every player, except possibly one, is finitely lived and cannot observe events that are sufficiently far back in the past. This class of games includes games between a long-run player and a sequence of short-run players, and games with overlapping generations of players. An equilibrium is purifiable if some close-by behaviour is consistent with equilibrium when agents' payoffs in each period are perturbed additively and independently. We show that only Markov equilibria are purifiable when social memory is finite. Thus if a game has at most one long-run player, all purifiable equilibria are Markov. Copyright 2013, Oxford University Press.

Suggested Citation

  • V. Bhaskar & George J. Mailath & Stephen Morris, 2013. "A Foundation for Markov Equilibria in Sequential Games with Finite Social Memory -super-," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 80(3), pages 925-948.
    • Handle: RePEc:oup:restud:v:80:y:2013:i:3:p:925-948
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1093/restud/rds047
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    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:oup:restud:v:80:y:2013:i:3:p:925-948. 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/restud .

    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.