We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Rank Reduction in Bimatrix Games.
- Authors
Heyman, Joseph L.; Gupta, Abhishek
- Abstract
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.
- Subjects
MATRIX pencils; GAMES; STRATEGY games
- Publication
International Game Theory Review, 2023, Vol 25, Issue 1, p1
- ISSN
0219-1989
- Publication type
Article
- DOI
10.1142/S0219198922500177