{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:15Z","timestamp":1760202675577,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_26","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"339-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Empirical Study of Finding Approximate Equilibria in Bimatrix Games"],"prefix":"10.1007","author":[{"given":"John","family":"Fearnley","sequence":"first","affiliation":[]},{"given":"Tobenna Peter","family":"Igwe","sequence":"additional","affiliation":[]},{"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-45046-4_2","volume-title":"Web and Internet Economics","author":"Y Anbalagan","year":"2013","unstructured":"Anbalagan, Y., Norin, S., Savani, R., Vetta, A.: Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2\/3. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 15\u201323. Springer, Heidelberg (2013)"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","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. Theoretical Computer Science 411(1), 164\u2013173 (2010)","journal-title":"Theoretical Computer Science"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. Journal of the ACM 56(3), 14:1\u201314:57 (2009)","DOI":"10.1145\/1516512.1516516"},{"key":"26_CR4","unstructured":"Codenotti, B., Rossi, S.D., Pagan, M.: An experimental analysis of Lemke-Howson algorithm (2008). CoRR, abs\/0811.3247"},{"issue":"1","key":"26_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 Journal on Computing 39(1), 195\u2013259 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"17","key":"26_CR6","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 410(17), 1581\u20131588 (2009)","journal-title":"Theoretical Computer Science"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Fearnley, J., Goldberg, P. W., Savani, R., S\u00f8rensen, T. B.: Approximate well-supported nash equilibria below two-thirds (2012). CoRR, abs\/1204.0707","DOI":"10.1007\/978-3-642-33996-7_10"},{"key":"26_CR8","unstructured":"Gatti, N., Patrini, G., Rocco, M., Sandholm, T.: Combining local search techniques and path following for bimatrix games (2012). CoRR, abs\/1210.4858"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.tcs.2013.01.013","volume":"476","author":"LA Goldberg","year":"2013","unstructured":"Goldberg, L.A., Goldberg, P.W., Krysta, P., Ventre, C.: Ranking games that have competitiveness-based strategies. Theor. Comput. Sci. 476, 24\u201337 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2465769.2465774","volume":"1","author":"PW Goldberg","year":"2013","unstructured":"Goldberg, P.W., Papadimitriou, C.H., Savani, R.: The complexity of the homotopy method, equilibrium selection, and lemke-howson solutions. ACM Trans. Economics and Comput. 1(2), 9 (2013)","journal-title":"ACM Trans. Economics and Comput."},{"issue":"4","key":"26_CR11","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s00453-008-9227-6","volume":"57","author":"SC Kontogiannis","year":"2010","unstructured":"Kontogiannis, S.C., Spirakis, P.G.: Well supported approximate equilibria in bimatrix games. Algorithmica 57(4), 653\u2013667 (2010)","journal-title":"Algorithmica"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-20662-7_1","volume-title":"Experimental Algorithms","author":"S Kontogiannis","year":"2011","unstructured":"Kontogiannis, S., Spirakis, P.: Approximability of symmetric bimatrix games and related experiments. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 1\u201320. Springer, Heidelberg (2011)"},{"issue":"2","key":"26_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"CE Lemke","year":"1964","unstructured":"Lemke, C.E., Howson Jr, J.: Equilibrium points of bimatrix games. Journal of the Society for Industrial and Applied Mathematics 12(2), 413\u2013423 (1964)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"26_CR14","unstructured":"Nudelman, E., Wortman, J., Shoham, Y., Leyton-Brown, K.: Run the gamut: a comprehensive approach to evaluating game-theoretic algorithms. In: AAMAS, pp. 880\u2013887 (2004)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Porter, R., Nudelman, E., Shoham, Y.: Simple search methods for finding a nash equilibrium. Games and Economic Behavior, 642\u2013662 (2008)","DOI":"10.1016\/j.geb.2006.03.015"},{"key":"26_CR16","unstructured":"Sandholm, T., Gilpin, A., Conitzer, V.: Mixed-integer programming methods for finding nash equilibria. In: AAAI, pp. 495\u2013501 (2005)"},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1111\/j.1468-0262.2006.00667.x","volume":"74","author":"R Savani","year":"2006","unstructured":"Savani, R., von Stengel, B.: Hard-to-solve bimatrix games. Econometrica 74(2), 397\u2013429 (2006)","journal-title":"Econometrica"},{"key":"26_CR18","unstructured":"Savani, R., von Stengel, B.: Unit vector games (2015). CoRR, abs\/1501.02243"},{"issue":"4","key":"26_CR19","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 5(4), 365\u2013382 (2008)","journal-title":"Internet Mathematics"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-92185-1_29","volume-title":"Internet and Network Economics","author":"H Tsaknakis","year":"2008","unstructured":"Tsaknakis, H., Spirakis, P.G., Kanoulas, D.: Performance Evaluation of a Descent Algorithm for Bi-matrix Games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 222\u2013230. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:39:42Z","timestamp":1676943582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}