IDEAS home Printed from https://ideas.repec.org/p/cla/levrem/321307000000000961.html
   My bibliography  Save this paper

Better-Reply Strategies with Bounded Recall

Author

Listed:
  • Andriy Zapechelnyuk

Abstract

A decision maker (an agent) is engaged in a repeated interaction with Nature. The objective of the agent is to guarantee to himself the long-run average payoff as large as the best-reply payoff to Nature?s empirical distribution of play, no matter what Nature does. An agent with perfect recall can achieve this objective by a simple better-reply strategy. In this paper we demonstrate that the relationship between perfect recall and bounded recall is not straightforward: An agent with bounded recall may fail to achieve this objective, no matter how long recall he has and no matter what better-reply strategy he employs.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Andriy Zapechelnyuk, 2007. "Better-Reply Strategies with Bounded Recall," Levine's Bibliography 321307000000000961, UCLA Department of Economics.
  • Handle: RePEc:cla:levrem:321307000000000961
    as

    Download full text from publisher

    File URL: http://ratio.huji.ac.il/dp_files/dp449.pdf
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
    2. Fudenberg, Drew & Levine, David K., 1995. "Consistency and cautious fictitious play," Journal of Economic Dynamics and Control, Elsevier, vol. 19(5-7), pages 1065-1089.
    3. Sergiu Hart & Andreu Mas-Colell, 2000. "A Simple Adaptive Procedure Leading to Correlated Equilibrium," Econometrica, Econometric Society, vol. 68(5), pages 1127-1150, September.
    4. Hart, Sergiu & Mas-Colell, Andreu, 2001. "A General Class of Adaptive Strategies," Journal of Economic Theory, Elsevier, vol. 98(1), pages 26-54, May.
    5. Ehud Lehrer & Eilon Solan, 2003. "No-Regret with Bounded Computational Capacity," Discussion Papers 1373, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    Full references (including those not matched with items on IDEAS)

    More about this item

    JEL classification:

    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • D81 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Criteria for Decision-Making under Risk and Uncertainty
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    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:levrem:321307000000000961. 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: (David K. Levine). General contact details of provider: http://www.dklevine.com/ .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.