{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T09:13:46Z","timestamp":1781169226516,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993664","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"195-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Rank-1 bimatrix games"],"prefix":"10.1145","author":[{"given":"Bharat","family":"Adsul","sequence":"first","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jugal","family":"Garg","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruta","family":"Mehta","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milind","family":"Sohoni","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.96.3.652"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.69"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.20"},{"key":"e_1_3_2_2_4_1","volume-title":"Linear Programming and Extensions","author":"Dantzig G. B.","year":"1963","unstructured":"G. B. Dantzig . Linear Programming and Extensions . Princeton University Press , 1963 . G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1997.0516"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0531(03)00005-X"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-009-0441-5"},{"key":"e_1_3_2_2_8_1","first-page":"1124","volume-title":"SODA","author":"Kannan R.","year":"2007","unstructured":"R. Kannan and T. Theobald . Games of fixed rank: A hierarchy of bimatrix games . In SODA , pages 1124 -- 1132 , 2007 . R. Kannan and T. Theobald. Games of fixed rank: A hierarchy of bimatrix games. In SODA, pages 1124--1132, 2007."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912320"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886521.1886546"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0112033"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779933"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380883"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.10.005"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2006.00667.x"},{"key":"e_1_3_2_2_18_1","first-page":"175","volume-title":"Mathematical Programming Studies","author":"Shapley L. S.","year":"1974","unstructured":"L. S. Shapley . A note on the lemke-howson algorithm . In Mathematical Programming Studies , pages 175 -- 189 , 1974 . L. S. Shapley. A note on the lemke-howson algorithm. In Mathematical Programming Studies, pages 175--189, 1974."},{"key":"e_1_3_2_2_19_1","volume-title":"CRM Proceedings, American Mathematical Society","author":"Theobald T.","year":"2007","unstructured":"T. Theobald . Enumerating the nash equilibria of rank-1 games. In Polyhedral Computation , CRM Proceedings, American Mathematical Society , 2007 . T. Theobald. Enumerating the nash equilibria of rank-1 games. In Polyhedral Computation, CRM Proceedings, American Mathematical Society, 2007."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79309-0_22"},{"key":"e_1_3_2_2_21_1","first-page":"53","volume-title":"Equilibrium computation for two-player games in strategic and extensive form","author":"von Stengel B.","year":"2007","unstructured":"B. von Stengel . Equilibrium computation for two-player games in strategic and extensive form . Chapter 3, Algorithmic Game Theory, eds. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani , pages 53 -- 78 , 2007 . B. von Stengel. Equilibrium computation for two-player games in strategic and extensive form. Chapter 3, Algorithmic Game Theory, eds. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, pages 53--78, 2007."}],"event":{"name":"STOC'11: Symposium on Theory of Computing","location":"San Jose California USA","acronym":"STOC'11","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993664","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993664"}},"subtitle":["a homeomorphism and a polynomial time algorithm"],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":21,"alternative-id":["10.1145\/1993636.1993664","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993664","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}