{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T04:54:46Z","timestamp":1790484886838,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642161698","type":"print"},{"value":"9783642161704","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_11","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T08:07:44Z","timestamp":1286957264000},"page":"114-125","source":"Crossref","is-referenced-by-count":22,"title":["On Learning Algorithms for Nash Equilibria"],"prefix":"10.1007","author":[{"given":"Constantinos","family":"Daskalakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Frongillo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Pierrakos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregory","family":"Valiant","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Blum, A., Hajiaghayi, M., Ligett, K., Roth, A.: Regret minimization and price of total anarchy. In: STOC 2008 (2008)","DOI":"10.1145\/1374376.1374430"},{"key":"11_CR2","unstructured":"Friedman, E., Shenker, S.: Learning and implementation on the Internet. Working paper (1997)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/game.1999.0738","volume":"29","author":"Y. Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.E.: Adaptive game playing using multiplicative weights. Games and Economic Behavior\u00a029, 79\u2013103 (1999)","journal-title":"Games and Economic Behavior"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Hart, S., Mansour, Y.: The communication complexity of uncoupled Nash equilibrium procedures. In: STOC 2007 (2007)","DOI":"10.1145\/1250790.1250843"},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1111\/1468-0262.00153","volume":"68","author":"S. Hart","year":"2000","unstructured":"Hart, S., Mas-Colell, A.: A simple adaptive procedure leading to correlated equilibrium. Econometrica\u00a068(5), 1127\u20131150 (2000)","journal-title":"Econometrica"},{"key":"11_CR6","volume-title":"Mathematical Methods and Theory in Games, Programming and Economics","author":"S. Karlin","year":"1994","unstructured":"Karlin, S.: Mathematical Methods and Theory in Games, Programming and Economics. Dover, New York (1994)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Piliouras, G., Tardos, \u00c9.: Multiplicative updates outperform generic no-regret learning in congestion games. In: STOC 2009 (2009)","DOI":"10.1145\/1536414.1536487"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Robinson, J.: An iterative method of solving a game. In: Annals of Mathematics (1951)","DOI":"10.2307\/1969530"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: STOC 2009 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Shapley, L.S.: Some topics in two-person games. In: Dresher, M., Aumann, R.J., Shapley, L.S., Tucker, A.W. (eds.) Advances in Ame Theory (1964)","DOI":"10.1515\/9781400882014-002"},{"issue":"48","key":"11_CR11","first-page":"77","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The Nonstochastic Multiarmed Bandit Problem. SIAM J. Comput.\u00a032(48), 77 (2002)","journal-title":"SIAM J. Comput."},{"key":"11_CR12","unstructured":"Arora, S., Hazan, E., Kale, S.: The Multiplicative Weights Update Method: a Meta Algorithm and Applications (2005) (Manuscript)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Abernethy, J., Rakhlin, A.: Beating the adaptive bandit with high probability. In: COLT 2009 (2009)","DOI":"10.1109\/ITA.2009.5044958"},{"key":"11_CR14","unstructured":"Zinkevich, M.: Theoretical guarantees for algorithms in multi-agent settings. Tech. Rep. CMU-CS-04- 161, Carnegie Mellon University (2004)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1006\/game.1999.0717","volume":"29","author":"M. Benaim","year":"1999","unstructured":"Benaim, M., Hirsch, M.W.: Mixed Equilibria and Dynamical Systems Arising from Fictitious Play in Perturbed Games. Games and Economic Behavior\u00a029, 36\u201372 (1999)","journal-title":"Games and Economic Behavior"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16170-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T08:21:14Z","timestamp":1559722874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}