Fixation Probabilities of Strategies for Bimatrix Games in Finite Populations

被引:21
|
作者
Sekiguchi, Takuya [1 ,2 ]
Ohtsuki, Hisashi [2 ]
机构
[1] Japan Soc Promot Sci, Chiyoda Ku, Sumitomo Ichibancho FS Bldg,8 Ichibancho, Tokyo 1028472, Japan
[2] SOKENDAI, Sch Adv Sci, Dept Evolutionary Studies Biosyst, Hayama, Kanagawa 2400193, Japan
关键词
Bimatrix games; Equilibrium selection; Finite population; Fixation probability; Stability; Stochastic evolution; EVOLUTIONARY STABILITY; STABLE STRATEGIES; PUBLIC-GOODS; COOPERATION; EMERGENCE; FAIRNESS; SELECTION; MUTATION; DYNAMICS;
D O I
10.1007/s13235-015-0170-2
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Recent developments in stochastic evolutionary game theory in finite populations yield insights that complement the conventional deterministic evolutionary game theory in infinite populations. However, most studies of stochastic evolutionary game theory have investigated dynamics of symmetric games, although not all social and biological phenomena are described by symmetric games, e.g., social interactions between individuals having conflicting preferences or different roles. In this paper, we describe the stochastic evolutionary dynamics of two-player bimatrix games in finite populations. The stochastic process is modeled by a frequency-dependent Moran process without mutation. We obtained the fixation probability that the evolutionary dynamics starting from a given initial state converges to a specific absorbing state. Applying the formula to the ultimatum game, we show that evolutionary dynamics favors fairness. Furthermore, we present two novel concepts of stability for bimatrix games, based on our formula for the fixation probability, and demonstrate that one of the two serves as a criterion for equilibrium selection.
引用
收藏
页码:93 / 111
页数:19
相关论文
共 50 条
  • [31] PARETO EQUILIBRIA FOR BIMATRIX GAMES
    BORM, PEM
    JANSEN, MJM
    POTTERS, JAM
    TIJS, SH
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1993, 25 (10-11) : 19 - 25
  • [32] NASH SUBSETS OF BIMATRIX GAMES
    MILLHAM, CB
    NAVAL RESEARCH LOGISTICS, 1974, 21 (02) : 307 - 317
  • [33] On Loss Aversion in Bimatrix Games
    Bram Driesen
    Andrés Perea
    Hans Peters
    Theory and Decision, 2010, 68 : 367 - 391
  • [34] Rank Reduction in Bimatrix Games
    Heyman, Joseph L.
    Gupta, Abhishek
    INTERNATIONAL GAME THEORY REVIEW, 2023, 25 (01)
  • [35] On Random Symmetric Bimatrix Games
    Abaffy, Jozsef
    Forgo, Ferenc
    INTERNATIONAL GAME THEORY REVIEW, 2020, 22 (03)
  • [36] ON THE DETERMINATENESS OF SEMIINFINITE BIMATRIX GAMES
    JURG, P
    TIJS, S
    INTERNATIONAL JOURNAL OF GAME THEORY, 1993, 21 (04) : 361 - 369
  • [37] Games of fixed rank: A hierarchy of bimatrix games
    Kannan, Ravi
    Theobald, Thorsten
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1124 - +
  • [38] PROBABILITIES WITHIN OPTIMAL STRATEGIES FOR TOURNAMENT GAMES
    FISHER, DC
    RYAN, J
    DISCRETE APPLIED MATHEMATICS, 1995, 56 (01) : 87 - 91
  • [39] PROBABILITY OF FIXATION IN FINITE POPULATIONS
    HEDRICK, PW
    COMSTOCK, RE
    GENETICS, 1968, 60 (1P2) : 187 - &
  • [40] Completely mixed bimatrix games
    T Parthasarathy
    Vasudha Sharma
    A R Sricharan
    Proceedings - Mathematical Sciences, 2020, 130