{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:13Z","timestamp":1725603673767},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_9","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"93-105","source":"Crossref","is-referenced-by-count":0,"title":["On the Approximation Performance of Fictitious Play in Finite Games"],"prefix":"10.1007","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[]},{"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[]},{"given":"Troels Bjerre","family":"S\u00f8rensen","sequence":"additional","affiliation":[]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Brandt, F., Fischer, F., Harrenstein, P.: On the Rate of Convergence of Fictitious Play. In: 3rd Symposium on Algorithmic Game Theory, pp. 102\u2013113 (2010)","DOI":"10.1007\/978-3-642-16170-4_10"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.jet.2004.02.003","volume":"120","author":"U. Berger","year":"2005","unstructured":"Berger, U.: Fictitious play in 2 \u00d7 n games. Journal of Economic Theory\u00a0120, 139\u2013154 (2005)","journal-title":"Journal of Economic Theory"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bosse, H., Byrka, J., Markakis, E.: New Algorithms for Approximate Nash Equilibria in Bimatrix Games. In: Proceedings of the 3rd International Workshop on Internet and Network Economics, pp. 17\u201329 (2007)","DOI":"10.1007\/978-3-540-77105-0_6"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X. Chen","year":"2009","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. Journal of the ACM\u00a056(3), 1\u201357 (2009)","journal-title":"Journal of the ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Conitzer, V.: Approximation Guarantees for Fictitious Play. In: Procs of 47th Annual Allerton Conference on Communication, Control, and Computing, pp. 636\u2013643 (2009)","DOI":"10.1109\/ALLERTON.2009.5394918"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-16170-4_11","volume-title":"Algorithmic Game Theory","author":"C. Daskalakis","year":"2010","unstructured":"Daskalakis, C., Frongillo, R., Papadimitriou, C.H., Pierrakos, G., Valiant, G.: On Learning Algorithms for Nash Equilibria. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) AGT 2010. LNCS, vol.\u00a06386, pp. 114\u2013125. Springer, Heidelberg (2010)"},{"issue":"17","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.tcs.2008.12.031","volume":"410","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.H.: A Note on Approximate Nash Equilibria. Theoretical Computer Science\u00a0410(17), 1581\u20131588 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. SIAM Journal on Computing\u00a039(1), 195\u2013259 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR9","volume-title":"The Theory of Learning in Games","author":"D. Fudenberg","year":"1998","unstructured":"Fudenberg, D., Levine, D.K.: The Theory of Learning in Games. MIT Press, Cambridge (1998)"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"296","DOI":"10.2307\/1969530","volume":"54","author":"J. Robinson","year":"1951","unstructured":"Robinson, J.: An Iterative Method of Solving a Game. Annals of Mathematics\u00a054(2), 296\u2013301 (1951)","journal-title":"Annals of Mathematics"},{"key":"9_CR11","series-title":"Annals of Mathematics Studies","volume-title":"Advances in Game Theory","author":"L. Shapley","year":"1964","unstructured":"Shapley, L.: Some topics in two-person games. In: Advances in Game Theory. Annals of Mathematics Studies, vol.\u00a052, Princeton University Press, Princeton (1964)"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1080\/15427951.2008.10129172","volume":"5","author":"H. Tsaknakis","year":"2008","unstructured":"Tsaknakis, H., Spirakis, P.G.: An Optimization Approach for Approximate Nash Equilibria. Internet Mathematics\u00a05(4), 365\u2013382 (2008)","journal-title":"Internet Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:08:37Z","timestamp":1560528517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}