{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:35:37Z","timestamp":1726410937776},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_1","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"3-14","source":"Crossref","is-referenced-by-count":0,"title":["Logarithmic Query Complexity for Approximate Nash Computation in Large Games"],"prefix":"10.1007","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[]},{"given":"Francisco J.","family":"Marmolejo Coss\u00edo","sequence":"additional","affiliation":[]},{"given":"Zhiwei Steven","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1287\/moor.1120.0557","volume":"38","author":"Y Azrieli","year":"2013","unstructured":"Azrieli, Y., Shmaya, E.: Lipschitz games. Math. Oper. Res. 38(2), 350\u2013357 (2013)","journal-title":"Math. Oper. Res."},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.geb.2013.04.007","volume":"81","author":"Y Babichenko","year":"2013","unstructured":"Babichenko, Y.: Best-reply dynamics in large binary-choice anonymous games. Games Econ. Behav. 81, 130\u2013144 (2013)","journal-title":"Games Econ. Behav."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Babichenko, Y.: Query complexity of approximate Nash equilibria. In: Proceedings of 46th STOC, pp. 535\u2013544 (2014)","DOI":"10.1145\/2591796.2591829"},{"issue":"3","key":"1_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2785668","volume":"4","author":"Y Babichenko","year":"2015","unstructured":"Babichenko, Y., Barman, S.: Query complexity of correlated equilibrium. ACM. Trans. Econ. Comput. 4(3), 1\u201335 (2015)","journal-title":"ACM. Trans. Econ. Comput."},{"key":"1_CR5","unstructured":"Chen, X., Cheng, Y., Tang, B.: Well-supported versus approximate Nash equilibria: Query complexity of large games (2015). ArXiv rept. 1511.00785"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Fearnley, J., Savani, R.: Finding approximate Nash equilibria of bimatrix games via payoff queries. In: Proceedings of 15th ACM EC, pp. 657\u2013674 (2014)","DOI":"10.1145\/2600057.2602847"},{"key":"1_CR7","first-page":"1305","volume":"16","author":"J Fearnley","year":"2015","unstructured":"Fearnley, J., Gairing, M., Goldberg, P.W., Savani, R.: Learning equilibria of games via payoff queries. J. Mach. Learn. Res. 16, 1305\u20131344 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"1_CR8","first-page":"341","volume":"1","author":"DP Foster","year":"2006","unstructured":"Foster, D.P., Young, H.P.: Regret testing: learning to play Nash equilibrium without knowing you have an opponent. Theor. Econ. 1(3), 341\u2013367 (2006)","journal-title":"Theor. Econ."},{"key":"1_CR9","unstructured":"Germano, F., Lugosi, G.: Global Nash convergence of Foster and Young\u2019s regret testing (2005). http:\/\/www.econ.upf.edu\/lugosi\/nash.pdf"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W., Roth, A.: Bounds for the query complexity of approximate equilibria. In: Proceedings of the 15th ACM-EC Conference, pp. 639\u2013656 (2014)","DOI":"10.1145\/2600057.2602845"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-662-48995-6_26","volume-title":"Web and Internet Economics","author":"PW Goldberg","year":"2015","unstructured":"Goldberg, P.W., Turchetta, S.: Query complexity of approximate equilibria in anonymous games. In: Markakis, E., et al. (eds.) WINE 2015. LNCS, vol. 9470, pp. 357\u2013369. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48995-6_26"},{"issue":"1","key":"1_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.geb.2007.12.002","volume":"69","author":"S Hart","year":"2010","unstructured":"Hart, S., Mansour, Y.: How long to equilibrium? the communication complexity of uncoupled equilibrium procedures. Games Econ. Behav. 69(1), 107\u2013126 (2010)","journal-title":"Games Econ. Behav."},{"issue":"5","key":"1_CR13","doi-asserted-by":"crossref","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 68(5), 1127\u20131150 (2000)","journal-title":"Econometrica"},{"issue":"5","key":"1_CR14","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1257\/000282803322655581","volume":"93","author":"S Hart","year":"2003","unstructured":"Hart, S., Mas-Colell, A.: Uncoupled dynamics do not lead to Nash equilibrium. Am. Econ. Rev. 93(5), 1830\u20131836 (2003)","journal-title":"Am. Econ. Rev."},{"key":"1_CR15","unstructured":"Hart, S., Nisan, N.: The query complexity of correlated equilibria (2013). ArXiv tech rept. 1305.4874"},{"issue":"6","key":"1_CR16","doi-asserted-by":"crossref","first-page":"1631","DOI":"10.1111\/j.1468-0262.2004.00549.x","volume":"72","author":"E Kalai","year":"2004","unstructured":"Kalai, E.: Large robust games. Econometrica 72(6), 1631\u20131665 (2004)","journal-title":"Econometrica"},{"issue":"5","key":"1_CR17","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1257\/aer.104.5.431","volume":"104","author":"M Kearns","year":"2014","unstructured":"Kearns, M., Pai, M.M., Roth, A., Ullman, J.: Mechanism design in large games: Incentives and privacy. Am. Econ. Rev. 104(5), 431\u2013435 (2014). doi: 10.1257\/aer.104.5.431","journal-title":"Am. Econ. Rev."},{"key":"1_CR18","unstructured":"Young, H.P.: Learning by trial and error (2009). http:\/\/www.econ2.jhu.edu\/people\/young\/Learning5June08.pdf"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:59:48Z","timestamp":1498341588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}