A counter-example to karlin's strong conjecture for fictitious play

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2014, Pages 11-20

  Daskalakis, Constantinos ^a   Pan, Qinxuan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

fictitious play; Karlin's conjecture; zero sum games

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COUNTER EXAMPLES; FICTITIOUS PLAY; IDENTITY MATRICES; KARLIN'S CONJECTURE; NATURAL DYNAMICS; PAYOFF MATRIX; TIE-BREAKING; ZERO-SUM GAME;

GAME THEORY;

EID: 84920039510     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2014.10     Document Type: Conference Paper

References (37)

1. I. Adler. The equivalence of linear programs and zero-sum games. International Journal of Game Theory, 42(1):165-177, 2013. I
2. D. J. Albers and C. Reid. An interview with George B. Dantzig: the father of linear programming. The College Mathematics Journal, 17(4):293-314, 1986. I
3. R. Aumann. Game theory. The new palgrave-a dictionary of Economics. Edited by John Eatwell, Murray Milgate and Peter Newman. The Macmillan Press Limited, 1987. I
4. U. Berger. Fictitious play in 2×n games. Journal of Economic Theory, 120(2):139-154, 2005. I-0a
5. F. Brandt, F. Fischer, and P. Harrenstein. On the rate of convergence of fictitious play. Theory of Computing Systems, 53:41-52, 2013. I-0a
6. G. W. Brown. Some notes on computation of games solutions. Technical report, P-78, The Rand Corporation, 1949. (document), I, I-0a
7. G. W. Brown. Iterative solution of games by fictitious play. Activity Analysis of Production and Allocation, 13(1):374-376, 1951. I
8. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006. I, I, I, I-0a
9. V. Conitzer. Approximation guarantees for fictitious play. In the 47th Annual Allerton Conference on Communication, Control, and Computing, pages 636-643. IEEE, 2009. I-0a
10. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963. I
11. C. Daskalakis, A. Deckelbaum, and A. Kim. Near-optimal noregret algorithms for zero-sum games. Games and Economic Behavior, 2014. I
12. D. P. Foster and H. P. Young. On the nonconvergence of fictitious play in coordination games. Games and Economic Behavior, 25(1):79-96, 1998. I-0a
13. Y. Freund and R. E. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29(1):79-103, 1999. I
14. D. Fudenberg. The theory of learning in games, volume 2. MIT press, 1998. I-0a
15. A. Gaunersdorfer and J. Hofbauer. Fictitious play, Shapley polygons, and the replicator equation. Games and Economic Behavior, 11(2):279-303, 1995. I-0a
16. P. W. Goldberg, R. Savani, T. B. Sørensen, and C. Ventre. On the approximation performance of fictitious play in finite games. International Journal of Game Theory, 42(4):1059-1083, 2013. I-0a
17. S. Hahn. The convergence of fictitious play in 3×3 games with strategic complementarities. Economics Letters, 64(1):57-60, 1999. I-0a
18. J. Hannan. Approximation to Bayes risk in repeated play. Contributions to the Theory of Games, 3:97-139, 1957. I-0a
19. C. Harris. On the rate of convergence of continuous-time fictitious play. Games and Economic Behavior, 22(2):238-259, 1998. I, I-0a
20. J. Hofbauer and K. Sigmund. Evolutionary game dynamics. Bulletin of the American Mathematical Society, 40(4):479-519, 2003. I-0a
21. S. Hon-Snir, D. Monderer, and A. Sela. A learning approach to auctions. Journal of Economic Theory, 82(1):65-88, 1998. I-0a
22. J. S. Jordan. Three problems in learning mixed-strategy Nash equilibria. Games and Economic Behavior, 5(3):368-386, 1993. I-0a
23. S. Karlin. Mathematical Methods and Theory in Games, Programming, and Economics. Addison-Wesley, 1959. 1, II
24. V. Krishna and T. Sjöström. Learning in games: Fictitious play dynamics. In Cooperation: Game-Theoretic Approaches, pages 257-273. Springer, 1997. I-0a
25. V. Krishna and T. Sjöström. On the convergence of fictitious play. Mathematics of Operations Research, 23(2):479-511, 1998. I-0a
26. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994. I
27. R. D. Luce and H. Raiffa. Games and Decisions: Introduction and Critical Survey. Courier Dover Publications, 1957. I
28. P. Milgrom and J. Roberts. Adaptive and sophisticated learning in normal form games. Games and Economic Behavior, 3(1):82-100, 1991. I-0a
29. K. Miyasawa. On the convergence of the learning process in a 2 x 2 non-zero-sum two-person game. Technical report, DTIC Document, 1961. I-0a
30. D. Monderer and A. Sela. A 2×2 game without the fictitious play property. Games and Economic Behavior, 14(1):144-148, 1996. I-0a
31. D. Monderer and L. S. Shapley. Fictitious play property for games with identical interests. Journal of Economic Theory, 68(1):258-265, 1996. I-0a
32. A. Rakhlin and K. Sridharan. Optimization, learning, and games with predictable sequences. In the 27th Annual Conference on Neural Information Processing Systems (NIPS), 2013. I
33. J. Robinson. An iterative method of solving a game. Annals of Mathematics, pages 296-301, 1951. (document), I, I-0a, II, II
34. A. Sela. Fictitious play in 2× 3 games. Games and Economic Behavior, 31(1):152-162, 2000. I-0a
35. L. S. Shapley. Some topics in two-person games. Advances in Game Theory, 52:1-29, 1964. I-0a
36. J. von Neumann. Zur Theorie der Gesellshaftsspiele. Mathematische Annalen, 100:295-320, 1928. I
37. J. von Neumann. A numerical method to determine optimum strategy. Naval Research Logistics Quarterly, 1(2):109-115, 1954. I-0a