{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:42:28Z","timestamp":1725864148362},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_2","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"15-26","source":"Crossref","is-referenced-by-count":3,"title":["Lipschitz Continuity and Approximate Equilibria"],"prefix":"10.1007","author":[{"given":"Argyrios","family":"Deligkas","sequence":"first","affiliation":[]},{"given":"John","family":"Fearnley","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"2","key":"2_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":"2_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":"2_CR3","doi-asserted-by":"crossref","unstructured":"Babichenko, Y., Barman, S., Peretz, R.: Simple approximate equilibria in large games. In: Proceeding of EC, pp. 753\u2013770 (2014)","DOI":"10.1145\/2600057.2602873"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Barman, S.: Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Caratheodory\u2019s theorem. In: Proceeding of STOC 2015, pp. 361\u2013369 (2015)","DOI":"10.1145\/2746539.2746566"},{"issue":"1","key":"2_CR5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.tcs.2009.09.023","volume":"411","author":"H Bosse","year":"2010","unstructured":"Bosse, H., Byrka, J., Markakis, E.: New algorithms for approximate Nash equilibria in bimatrix games. Theor. Comput. Sci. 411(1), 164\u2013173 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Procaccia, A.D.: Biased games. In: Proceeding of AAAI, pp. 609\u2013615 (2014)","DOI":"10.1609\/aaai.v28i1.8831"},{"issue":"2","key":"2_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1006\/obhd.1999.2841","volume":"79","author":"GB Chapman","year":"1999","unstructured":"Chapman, G.B., Johnson, E.J.: Anchoring, activation, and the construction of values. Organ. Behav. Hum. Decis. Process. 79(2), 115\u2013153 (1999)","journal-title":"Organ. Behav. Hum. Decis. Process."},{"issue":"3","key":"2_CR8","doi-asserted-by":"crossref","first-page":"14: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. J. ACM 56(3), 14:1\u201314:57 (2009)","journal-title":"J. ACM"},{"issue":"1","key":"2_CR9","doi-asserted-by":"crossref","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":"2_CR10","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Mehta, A., Papadimitriou, C.H.: Progress in approximate Nash equilibria. In: Proceeding of EC, pp. 355\u2013358 (2007)","DOI":"10.1145\/1250910.1250962"},{"issue":"17","key":"2_CR11","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 410(17), 1581\u20131588 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Papadimitriou, C.H.: Approximate Nash equilibria in anonymous games. J. Econ. Theory (2014, to appear)","DOI":"10.1016\/j.jet.2014.02.002"},{"issue":"C","key":"2_CR13","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1016\/j.jet.2015.02.001","volume":"157","author":"J Deb","year":"2015","unstructured":"Deb, J., Kalai, E.: Stability in large Bayesian games with heterogeneous players. J. Econ. Theor. 157(C), 1041\u20131055 (2015)","journal-title":"J. Econ. Theor."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Fiat, A., Papadimitriou, C.H.: When the players are not expectation maximizers. In: SAGT, pp. 1\u201314 (2010)","DOI":"10.1007\/978-3-642-16170-4_1"},{"issue":"2","key":"2_CR15","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0749-5978(92)90015-Y","volume":"51","author":"D Kahneman","year":"1992","unstructured":"Kahneman, D.: Reference points, anchors, norms, and mixed feelings. Organ. Behav. Hum. Decis. Process. 51(2), 296\u2013312 (1992)","journal-title":"Organ. Behav. Hum. Decis. Process."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: EC, pp. 36\u201341 (2003)","DOI":"10.1145\/779928.779933"},{"key":"2_CR17","unstructured":"Mavronicolas, M., Monien, B.: The complexity of equilibria for risk-modeling valuations. CoRR, abs\/1510.08980 (2015)"},{"issue":"2","key":"2_CR18","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"issue":"3","key":"2_CR19","doi-asserted-by":"crossref","first-page":"520","DOI":"10.2307\/1911749","volume":"33","author":"JB Rosen","year":"1965","unstructured":"Rosen, J.B.: Existence and uniqueness of equilibrium points for concave n-person games. Econometrica 33(3), 520\u2013534 (1965)","journal-title":"Econometrica"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Rubinstein, A.: Settling the complexity of computing approximate two-player nash equilibria. CoRR, abs\/1606.04550 (2016)","DOI":"10.1109\/FOCS.2016.35"},{"issue":"4","key":"2_CR21","doi-asserted-by":"crossref","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 Math. 5(4), 365\u2013382 (2008)","journal-title":"Internet Math."},{"issue":"4157","key":"2_CR22","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1126\/science.185.4157.1124","volume":"185","author":"A Tversky","year":"1974","unstructured":"Tversky, A., Kahneman, D.: Judgment under uncertainty: heuristics and biases. Science 185(4157), 1124\u20131131 (1974)","journal-title":"Science"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T18:50:06Z","timestamp":1657219806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}