{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:23:20Z","timestamp":1753881800595,"version":"3.41.2"},"reference-count":38,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"name":"NSF CRII","award":["1565487"],"award-info":[{"award-number":["1565487"]}]},{"name":"NSF ECCS","award":["1610615"],"award-info":[{"award-number":["1610615"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. Game Theory Rev."],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:p> The rank of a bimatrix game is defined as the rank of the sum of the payoff matrices of the two players. The rank of a game is known to impact both the most suitable computation methods for determining a solution and the expressive power of the game. Under certain conditions on the payoff matrices, we devise a method that reduces the rank of the game without changing the equilibria of the game. We leverage matrix pencil theory and the Wedderburn rank reduction formula to arrive at our results. We also present a constructive proof of the fact that in a generic square game, the rank of the game can be reduced by 1, and in generic rectangular game, the rank of the game can be reduced by 2 under certain assumptions. <\/jats:p>","DOI":"10.1142\/s0219198922500177","type":"journal-article","created":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T08:58:13Z","timestamp":1653555493000},"source":"Crossref","is-referenced-by-count":1,"title":["Rank Reduction in Bimatrix Games"],"prefix":"10.1142","volume":"25","author":[{"given":"Joseph L.","family":"Heyman","sequence":"first","affiliation":[{"name":"Electrical Engineering and Computer Science, United States Military Academy, 606 Thayer Rd, West Point, New York 10996, USA"}]},{"given":"Abhishek","family":"Gupta","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering, The Ohio State University, 2015 Neil Avenue, Columbus, OH 43210, United State"}]}],"member":"219","published-online":{"date-parts":[[2022,7,4]]},"reference":[{"key":"S0219198922500177BIB001","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/978-3-642-10841-9_44","volume-title":"Internet and Network Economics","author":"Adler I.","year":"2009"},{"key":"S0219198922500177BIB002","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/1993636.1993664","volume-title":"Proc. Forty-Third Annual ACM Symp. Theory of Computing","author":"Adsul B.","year":"2011"},{"issue":"2","key":"S0219198922500177BIB003","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1287\/opre.2020.1981","volume":"69","author":"Adsul B.","year":"2021","journal-title":"Oper. Res."},{"key":"S0219198922500177BIB004","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/2488608.2488694","volume-title":"Proc. Forty-Fifth Annual ACM Symp. Theory of Computing","author":"Alon N.","year":"2013"},{"issue":"3","key":"S0219198922500177BIB005","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02253055","volume":"21","author":"Alt H.","year":"1979","journal-title":"Computing"},{"key":"S0219198922500177BIB006","doi-asserted-by":"publisher","DOI":"10.1137\/0109046"},{"issue":"3","key":"S0219198922500177BIB007","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1137\/15M1050574","volume":"47","author":"Barman S.","year":"2018","journal-title":"SIAM J. Comput."},{"key":"S0219198922500177BIB008","first-page":"17","volume-title":"Int. Workshop Web and Internet Economics","author":"Bosse H.","year":"2007"},{"issue":"4","key":"S0219198922500177BIB009","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1137\/1037124","volume":"37","author":"Chu M. T.","year":"1995","journal-title":"SIAM Rev."},{"key":"S0219198922500177BIB010","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/11944874_27","volume-title":"Int. Workshop on Internet and Network Economics","author":"Daskalakis C.","year":"2006"},{"key":"S0219198922500177BIB011","first-page":"355","volume-title":"Proc. 8th ACM Conf. Electronic Commerce","author":"Daskalakis C.","year":"2007"},{"issue":"2","key":"S0219198922500177BIB012","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/362515.362564","volume":"14","author":"Dell A. M.","year":"1971","journal-title":"Commun. ACM"},{"issue":"2","key":"S0219198922500177BIB013","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/152613.152615","volume":"19","author":"Demmel J.","year":"1993","journal-title":"ACM Trans. Math. Softw."},{"key":"S0219198922500177BIB014","volume-title":"The Theory of Matrices","volume":"2","author":"Gantmacher F. R.","year":"1959"},{"key":"S0219198922500177BIB015","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"Golub G. H.","year":"2013","edition":"4"},{"volume-title":"Noncooperative Game Theory: An Introduction for Engineers and Computer Scientists","year":"2017","author":"Hespanha J. P.","key":"S0219198922500177BIB016"},{"issue":"2","key":"S0219198922500177BIB017","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/BF01098963","volume":"64","author":"Ikramov K. D.","year":"1993","journal-title":"J. Sov. Math."},{"issue":"3","key":"S0219198922500177BIB018","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1002\/nav.3800270306","volume":"27","author":"Isaacson K.","year":"1980","journal-title":"Nav. Res. Logist. Q."},{"key":"S0219198922500177BIB019","first-page":"1124","volume-title":"Proc. Eighteenth Annual ACM-SIAM Symp. Discrete Algorithms","author":"Kannan R.","year":"2007"},{"issue":"1","key":"S0219198922500177BIB020","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s00199-009-0436-2","volume":"42","author":"Kannan R.","year":"2010","journal-title":"Econ. Theory"},{"key":"S0219198922500177BIB021","doi-asserted-by":"publisher","DOI":"10.1007\/BF01258280"},{"key":"S0219198922500177BIB022","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.tcs.2012.01.016","volume":"432","author":"Kontogiannis S.","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"S0219198922500177BIB023","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/11944874_26","volume-title":"Int. Workshop Internet and Network Economics","author":"Kontogiannis S. C.","year":"2006"},{"issue":"4","key":"S0219198922500177BIB024","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s00453-008-9227-6","volume":"57","author":"Kontogiannis S. C.","year":"2010","journal-title":"Algorithmica"},{"key":"S0219198922500177BIB025","first-page":"36","volume-title":"Proc. 4th ACM Conf. Electronic Commerce","author":"Lipton R. J.","year":"2003"},{"key":"S0219198922500177BIB027","doi-asserted-by":"publisher","DOI":"10.1137\/0710024"},{"issue":"3","key":"S0219198922500177BIB028","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01769190","volume":"7","author":"Moulin H.","year":"1978","journal-title":"Int. J. Game Theory"},{"volume-title":"Game Theory: Analysis of Conflict","year":"1991","author":"Myerson R. B.","key":"S0219198922500177BIB029"},{"key":"S0219198922500177BIB030","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"key":"S0219198922500177BIB031","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/301250.301389","volume-title":"Proc. Thirty-First Annual ACM Symp. Theory of Computing","author":"Pan V. Y.","year":"1999"},{"issue":"1","key":"S0219198922500177BIB032","doi-asserted-by":"crossref","first-page":"6116","DOI":"10.1016\/j.ifacol.2017.08.2019","volume":"50","author":"Possieri C.","year":"2017","journal-title":"IFAC-PapersOnLine"},{"key":"S0219198922500177BIB033","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1090\/crmp\/048\/06","volume-title":"Polyhedral Computation, CRM Proceedings and Lecture Notes","volume":"48","author":"Theobald T.","year":"2009"},{"issue":"4","key":"S0219198922500177BIB034","first-page":"548","volume":"26","author":"Thompson G. L.","year":"1970","journal-title":"Proc. Amer. Math. Soc."},{"issue":"3","key":"S0219198922500177BIB035","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0024-3795(72)90003-1","volume":"5","author":"Thompson G. L.","year":"1972","journal-title":"Linear Algebra Appl."},{"key":"S0219198922500177BIB036","doi-asserted-by":"publisher","DOI":"10.1007\/BF01448847"},{"key":"S0219198922500177BIB037","doi-asserted-by":"crossref","DOI":"10.1017\/9781108910118","volume-title":"Game Theory Basics","author":"von Stengel B.","year":"2021"},{"key":"S0219198922500177BIB038","volume-title":"Lectures on Matrices: American Mathematical Society Colloquium Publications","volume":"17","author":"Wedderburn J. H.","year":"1934"},{"issue":"3","key":"S0219198922500177BIB039","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1137\/1010061","volume":"10","author":"Weil R. L.","year":"1968","journal-title":"SIAM Rev."}],"container-title":["International Game Theory Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219198922500177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T08:36:19Z","timestamp":1677832579000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219198922500177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,4]]},"references-count":38,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["10.1142\/S0219198922500177"],"URL":"https:\/\/doi.org\/10.1142\/s0219198922500177","relation":{},"ISSN":["0219-1989","1793-6675"],"issn-type":[{"type":"print","value":"0219-1989"},{"type":"electronic","value":"1793-6675"}],"subject":[],"published":{"date-parts":[[2022,7,4]]},"article-number":"2250017"}}