SOME REMARKS ON EVOLUTIONARY STABILITY IN MATRIX GAMES
被引:2
|
作者:
Rao, K. S. Mallikarjuna
论文数: 0引用数: 0
h-index: 0
机构:
Indian Inst Technol, Ind Engn & Operat Res, Bombay 400076, Maharashtra, IndiaIndian Inst Technol, Ind Engn & Operat Res, Bombay 400076, Maharashtra, India
Rao, K. S. Mallikarjuna
[1
]
Shaiju, A. J.
论文数: 0引用数: 0
h-index: 0
机构:
Indian Inst Technol Madras, Dept Math, Madras 600036, Tamil Nadu, IndiaIndian Inst Technol, Ind Engn & Operat Res, Bombay 400076, Maharashtra, India
Shaiju, A. J.
[2
]
机构:
[1] Indian Inst Technol, Ind Engn & Operat Res, Bombay 400076, Maharashtra, India
[2] Indian Inst Technol Madras, Dept Math, Madras 600036, Tamil Nadu, India
ESS;
symmetric game;
pure and mixed strategies;
multiple mutations;
Pareto efficient;
globally strictly efficient;
D O I:
10.1142/S0219198913400240
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
In this article, we revisit evolutionary stability in matrix games. We provide a new direct proof to characterize a pure evolutionarily stable strategy (ESS), in games with exactly two pure strategies, as a strategy that is evolutionarily stable against multiple mutations. This direct proof yields generalizations to k x k games which explains why such a characterization is not possible in general. Furthermore, we prove other necessary/sufficient conditions for evolutionary stability against multiple mutations.