Fast convergence of regularized learning in games

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 2989-2997

  Syrgkanis, Vasilis ^a   Agarwal, Alekh ^a   Luo, Haipeng ^b   Schapire, Robert E ^a  

^a MICROSOFT RESEARCH   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE; LEARNING ALGORITHMS;

BLACK-BOX REDUCTIONS; CORRELATED EQUILIBRIA; FAST CONVERGENCE; FASTER CONVERGENCE; LEARNING IN GAMES; MULTIPLAYERS; NORMAL FORM GAMES; ZERO-SUM GAME;

ALGORITHMS;

EID: 84965105869     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. A. Blum and Y. Mansour. Learning, regret minimization, and equilibria. In Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay Vazirani, editors, Algorithmic Game Theory, chapter 4, pages 4-30. Cambridge University Press, 2007.
2. Avrim Blum, Mohammad Taghi Hajiaghayi, Katrina Ligett, and Aaron Roth. Regret minimization and the price of total anarchy. In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC'08, pages 373-382, New York, NY, USA, 2008. ACM.
3. Nicolo Cesa-Bianchi and Gabor Lugosi. Prediction, Learning, and Games. Cambridge University Press, New York, NY, USA, 2006.
4. Constantinos Daskalakis, Alan Deckelbaum, and Anthony Kim. Near-optimal no-regret algorithms for zero-sum games. Games and Economic Behavior, 92:327-348, 2014.
5. Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. Working Paper 11765, National Bureau of Economic Research, November 2005.
6. Dean P. Foster and Rakesh V. Vohra. Calibrated learning and correlated equilibrium. Games and Economic Behavior, 21(12):40-55, 1997.
7. Yoav Freund and Robert E Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
8. Yoav Freund and Robert E Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29(1):79-103, 1999.
9. Drew Fudenberg and Alexander Peysakhovich. Recency, records and recaps: Learning and nonequilibrium behavior in a simple decision problem. In Proceedings of the Fifteenth ACM Conference on Economics and Computation, EC'14, pages 971-986, New York, NY, USA, 2014. ACM.
10. Sergiu Hart and Andreu Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68(5):1127-1150, 2000.
11. Wassily Hoeffding and J. Wolfowitz. Distinguishability of sets of distributions. Ann. Math. Statist., 29(3):700-718, 1958.
12. Adam Kalai and Santosh Vempala. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71(3):291-307, 2005. Learning Theory 2003 Learning Theory 2003.
13. Nick Littlestone and Manfred K Warmuth. The weighted majority algorithm. Information and computation, 108(2):212-261, 1994.
14. AS Nemirovsky and DB Yudin. Problem complexity and method efficiency in optimization. 1983.
15. Yu. Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming, 103(1):127-152, 2005.
16. Alexander Rakhlin and Karthik Sridharan. Online learning with predictable sequences. In COLT 2013, pages 993-1019, 2013.
17. Alexander Rakhlin and Karthik Sridharan. Optimization, learning, and games with predictable sequences. In Advances in Neural Information Processing Systems, pages 3066-3074, 2013.
18. T. Roughgarden. Intrinsic robustness of the price of anarchy. In Proceedings of the 41st annual ACM symposium on Theory of computing, pages 513-522, New York, NY, USA, 2009. ACM.
19. Shai Shalev-Shwartz. Online learning and online convex optimization. Found. Trends Mach. Learn., 4(2):107-194, February 2012.
20. Vasilis Syrgkanis and Éva Tardos. Composable and efficient mechanisms. In Proceedings of the Fortyfifth Annual ACM Symposium on Theory of Computing, STOC'13, pages 211-220, New York, NY, USA, 2013. ACM.