IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v28y1999i1p69-87.html
   My bibliography  Save this article

Recall in extensive form games

Author

Listed:
  • Klaus Ritzberger

    (Institute for Advanced Studies, Stumpergasse 56, A-1060 Vienna, Austria)

Abstract

This paper considers characterizations of perfect recall in extensive form games. It is shown that perfect recall can be expressed in terms of choices without any reference to infomation sets. When information sets are taken into account, it is decomposable into an ordering of information sets and that players do not forget what they knew nor what they did. Thus, if information sets are partially ordered, then perfect recall is implied by the player's inability to refine her information from the memory.

Suggested Citation

  • Klaus Ritzberger, 1999. "Recall in extensive form games," International Journal of Game Theory, Springer;Game Theory Society, vol. 28(1), pages 69-87.
  • Handle: RePEc:spr:jogath:v:28:y:1999:i:1:p:69-87
    Note: Received: August 1997/final version: September 1998
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00182/papers/9028001/90280069.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Iryna Topolyan, 2020. "On Common Belief in Future Rationality in Games with Ambiguous Orderings of Information Sets," Dynamic Games and Applications, Springer, vol. 10(1), pages 183-201, March.
    2. Heymann, Benjamin & De Lara, Michel & Chancelier, Jean-Philippe, 2022. "Kuhn's equivalence theorem for games in product form," Games and Economic Behavior, Elsevier, vol. 135(C), pages 220-240.
    3. Bonanno, Giacomo, 2003. "A syntactic characterization of perfect recall in extensive games," Research in Economics, Elsevier, vol. 57(3), pages 201-217, September.
    4. Carlos Alós-Ferrer & Klaus Ritzberger, 2017. "Characterizations of perfect recall," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(2), pages 311-326, May.
    5. Peter A. Streufert, 2019. "Equivalences among five game specifications, including a new specification whose nodes are sets of past choices," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(1), pages 1-32, March.
    6. Muraviev, Igor & Riedel, Frank & Sass, Linda, 2017. "Kuhn’s Theorem for extensive form Ellsberg games," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 26-41.
    7. Hillas, John & Kvasov, Dmitriy, 2020. "Backward induction in games without perfect recall," Games and Economic Behavior, Elsevier, vol. 124(C), pages 207-218.
    8. Bonanno, Giacomo, 2004. "Memory and perfect recall in extensive games," Games and Economic Behavior, Elsevier, vol. 47(2), pages 237-256, May.
    9. Battigalli, Pierpaolo & Generoso, Nicolò, 2024. "Information flows and memory in games," Games and Economic Behavior, Elsevier, vol. 145(C), pages 356-376.

    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:spr:jogath:v:28:y:1999:i:1:p:69-87. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.