{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:22:32Z","timestamp":1725830552245},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662484326"},{"type":"electronic","value":"9783662484333"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48433-3_22","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T11:07:03Z","timestamp":1443092823000},"page":"285-296","source":"Crossref","is-referenced-by-count":5,"title":["Approximating Nash Equilibria in Tree Polymatrix Games"],"prefix":"10.1007","author":[{"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[]},{"given":"Katrina","family":"Ligett","sequence":"additional","affiliation":[]},{"given":"Georgios","family":"Piliouras","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Babichenko, Y., Barman, S., Peretz, R.: Simple approximate equilibria in large games. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 753\u2013770. ACM (2014)","DOI":"10.1145\/2600057.2602873"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C.: On minmax theorems for multiplayer games. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 217\u2013234. SIAM (2011)","DOI":"10.1137\/1.9781611973082.20"},{"issue":"3","key":"22_CR3","doi-asserted-by":"publisher","first-page":"14","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. J. ACM (JACM) 56(3), 14 (2009)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"22_CR4","first-page":"23","volume":"9","author":"C Daskalakis","year":"2013","unstructured":"Daskalakis, C.: On the complexity of approximating a Nash equilibrium. ACM Trans. Algorithms (TALG) 9(3), 23 (2013)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1","key":"22_CR5","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 J. Comput. 39(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11944874_27","volume-title":"Internet and Network Economics","author":"C Daskalakis","year":"2006","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 297\u2013306. Springer, Heidelberg (2006)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.: Progress in approximate Nash equilibria. In: Proceedings of the 8th ACM Conference on Electronic Commerce. pp. 355\u2013358. ACM (2007)","DOI":"10.1145\/1250910.1250962"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-02930-1_35","volume-title":"Automata, Languages and Programming","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Papadimitriou, C.H.: On a network generalization of the minmax theorem. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 423\u2013434. Springer, Heidelberg (2009)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/978-3-319-13129-0_5","volume-title":"Web and Internet Economics","author":"A Deligkas","year":"2014","unstructured":"Deligkas, A., Fearnley, J., Savani, R., Spirakis, P.: Computing approximate nash equilibria in polymatrix games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 58\u201371. Springer, Heidelberg (2014)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Elkind, E., Goldberg, L.A., Goldberg, P.: Nash equilibria in graphical games on trees revisited. In: Proceedings of the 7th ACM Conference on Electronic Commerce, pp. 100\u2013109. ACM (2006)","DOI":"10.1145\/1134707.1134719"},{"issue":"5\u2013part\u20131","key":"22_CR11","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1287\/mnsc.18.5.312","volume":"18","author":"JT Howson Jr","year":"1972","unstructured":"Howson Jr., J.T.: Equilibria of polymatrix games. Manage. Sci. 18(5\u2013part\u20131), 312\u2013318 (1972)","journal-title":"Manage. Sci."},{"key":"22_CR12","unstructured":"Kearns, M., Littman, M.L., Singh, S.: Graphical models for game theory. In: Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, pp. 253\u2013260. Morgan Kaufmann Publishers Inc. (2001)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: Proceedings of the 4th ACM Conference on Electronic Commerce, pp. 36\u201341. ACM (2003)","DOI":"10.1145\/779928.779933"},{"issue":"1","key":"22_CR14","first-page":"148","volume":"141","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. Surv. Comb. 141(1), 148\u2013188 (1989)","journal-title":"Surv. Comb."},{"key":"22_CR15","unstructured":"Ortiz, L.E., Kearns, M.: Nash propagation for loopy graphical games. In: Advances in Neural Information Processing Systems. pp. 793\u2013800 (2002)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Rubinstein, A.: Inapproximability of nash equilibrium. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC) (2015)","DOI":"10.1145\/2746539.2746578"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-77105-0_8","volume-title":"Internet and Network Economics","author":"H Tsaknakis","year":"2007","unstructured":"Tsaknakis, H., Spirakis, P.G.: An optimization approach for approximate Nash equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 42\u201356. Springer, Heidelberg (2007)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Yanovskaya, E.B.: Equilibrium points in polymatrix games. Lithuanian Mathematical Journal (1968) (in Russian)","DOI":"10.15388\/LMJ.1968.20224"}],"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-48433-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T06:00:18Z","timestamp":1653199218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48433-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662484326","9783662484333"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48433-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}