Completely mixed bimatrix games
T Parthasarathty Vasudha Sharma A R Sricharan
Click here to view fulltext PDF
Permanent link:
https://www.ias.ac.in/article/fulltext/pmsc/130/0047
Kaplansky (Ann. Math. 46(3) (1945) 474–479) introduced the notion of completely mixed games. Fifty years later in 1995, he wrote another beautiful paper where he gave a set of necessary and sufficient conditions for a skew symmetric matrix game to be completely mixed. In this work, we attempt to answer when bimatrix games will be completely mixed. In particular, we give a set of necessary and sufficient condition for a bimatrix game $(A, B)$ to be completely mixed when $A$ and $B$ are skew symmetric matrices of order 3. We give several examples to show the sharpness of our result. We also formulate a conjecture when $A$ and $B$ are skew symmetric matrices of order 5.
T Parthasarathty1 Vasudha Sharma2 A R Sricharan2
Volume 130, 2020
All articles
Continuous Article Publishing mode
Click here for Editorial Note on CAP Mode
© 2021-2022 Indian Academy of Sciences, Bengaluru.