IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

The Strategic Value of Recall

  • Ron Peretz

    ()

Registered author(s):

    This work studies the value of two-person zero-sum repeated games in which at least one of the players is restricted to (mixtures of) bounded recall strategies. A (pure) k-recall strategy is a strategy that relies only on the last k periods of history. This work improves previous results [Lehrer, Neyman and Okada] on repeated games with bounded recall. We provide an explicit formula for the asymptotic value of the repeated game as a function of the stage game, the duration of the repeated game, and the recall of the agents.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL: http://ratio.huji.ac.il/sites/default/files/publications/dp470.pdf
    Download Restriction: no

    Paper provided by The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem in its series Discussion Paper Series with number dp470.

    as
    in new window

    Length: 19 pages
    Date of creation: Nov 2007
    Date of revision:
    Handle: RePEc:huj:dispap:dp470
    Contact details of provider: Postal: Feldman Building - Givat Ram - 91904 Jerusalem
    Phone: +972-2-6584135
    Fax: +972-2-6513681
    Web page: http://www.ratio.huji.ac.il/
    Email:


    More information through EDIRC

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as in new window
    1. Abraham Neyman & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy, and Nonstationary Bounded Recall," Levine's Bibliography 122247000000000920, UCLA Department of Economics.
    2. Neyman, Abraham & Okada, Daijiro, 2000. "Repeated Games with Bounded Entropy," Games and Economic Behavior, Elsevier, vol. 30(2), pages 228-247, February.
    3. Lehrer Ehud, 1994. "Finitely Many Players with Bounded Recall in Infinitely Repeated Games," Games and Economic Behavior, Elsevier, vol. 7(3), pages 390-405, November.
    4. Abraham Neyman Null & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy and Nonstationary Bounded Recall," Departmental Working Papers 200514, Rutgers University, Department of Economics.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp470. 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: (Ilan Nehama)

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.