Completely mixed bimatrix games

被引：0

作者：

T Parthasarathy

Vasudha Sharma

A R Sricharan

机构：

[1] Indian Statistical Institute,

[2] Chennai Centre,undefined

[3] Chennai Mathematical Institute,undefined

来源：

Proceedings - Mathematical Sciences | 2020年 / 130卷

关键词：

Zero sum matrix games; bimatrix games; skew symmetric matrices; completely mixed bimatrix games; 91A05; 91A10;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用