Better-Reply Dynamics with Bounded Recall

References

• Aumann R. J., Bohm V. Survey of repeated games. Essays in Game Theory and Mathematical Economics in Honor of Oskar Morgenstern (1981) (Bibliographisches Institut, Mannheim) 11–42Google Scholar
• Aumann R. J., Sorin S. Cooperation and bounded recall. Games Econom. Behav. (1989) 1(1):5–39Crossref, Google Scholar
• Ben-Porath E. Repeated games with finite automata. J. Econom. Theory (1993) 59(1):17–32Crossref, Google Scholar
• Blackwell D. An analog of the minmax theorem for vector payoffs. Pacific J. Math. (1956) 6(1):1–8Crossref, Google Scholar
• Cesa-Bianchi N., Lugosi G. Potential-based algorithms in on-line prediction and game theory. Machine Learning (2003) 51(3):239–261Crossref, Google Scholar
• Cesa-Bianchi N., Freund Y., Helmbold D., Haussler D., Shapire R., Warmuth M. How to use expert advice. J. ACM (1997) 44:427–485Crossref, Google Scholar
• Foster D., Vohra R. Regret in the online decision problem. Games Econom. Behav. (1999) 29(1-2):7–35Crossref, Google Scholar
• Freund Y., Schapire R. Game theory, on-line prediction and boosting. Proc. Ninth Annual Conf. Computational Learn. Theory (1996) June 28–July 1, 1996Desenzano del Garda, Italy:325–332Crossref, Google Scholar
• Fudenberg D., Levine D. Universal consistency and cautious fictitious play. J. Econom. Dynam. Control (1995) 19(5-7):1065–1089Crossref, Google Scholar
• Hannan J., Dresher M., Tucker A. W., Wolfe P. Approximation to Bayes risk in repeated play. Contributions to the Theory of Games, Vol. 3. Annals of Mathematics Studies 39 (1957) (Princeton University Press, Princeton, NJ) 97–139Google Scholar
• Hart S., Mas-Colell A. A simple adaptive procedure leading to correlated equilibrium. Econometrica (2000) 68(5):1127–1150Crossref, Google Scholar
• Hart S., Mas-Colell A. A general class of adaptive procedures. J. Econom. Theory (2001) 98(1):26–54Crossref, Google Scholar
• Lehrer E. Repeated games with stationary bounded recall strategies. J. Econom. Theory (1988) 46(1):130–144Crossref, Google Scholar
• Lehrer E. Finitely many players with bounded recall in infinitely repeated games. Games Econom. Behav. (1994) 7(3):390–405Crossref, Google Scholar
• Lehrer E., Solan E. No regret with bounded computational capacity. (2003) . Discussion paper 1373, The Center for Mathematical Studies in Economics and Management Science, Northwestern University, Evanston, ILGoogle Scholar
• Littlestone N., Warmuth M. The weighted majority algorithm. Inform. Comput. (1994) 108(2):212–261Crossref, Google Scholar
• Neyman A. Finitely repeated games with finite automata. Math. Oper. Res. (1998) 23(3):513–552Link, Google Scholar
• Neyman A., Okada D. Repeated games with bounded entropy. Games Econom. Behav. (2000) 30(2):228–247Crossref, Google Scholar
• Rubinstein A. Finite automata play the repeated prisoner's dilemma. J. Econom. Theory (1986) 39(1):83–96Crossref, Google Scholar
• Vovk V. A game of prediction with expert advice. J. Comput. System Sci. (1998) 56(2):153–173Crossref, Google Scholar
• Watson J. Cooperation in the infinitely repeated prisoner's dilemma with perturbations. Games Econom. Behav. (1994) 7(2):260–285Crossref, Google Scholar