Name
Abstract | ||
|---|---|---|
The rank of a bimatrix game is defined as the rank of the sum of the payoff matrices of the two players. Under certain conditions on the payoff matrices, we devise a method that reduces the rank of the game without changing the equilibrium of the game. We leverage matrix pencil theory and 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. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Computer Science and Game Theory | Journal |
Volume | Citations | PageRank |
abs/1904.00457 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joseph L. Heyman | 1 | 0 | 1.35 |
| Abhishek Gupta | 2 | 14 | 10.61 |