Evolutionary instability of selfish learning in repeated games

被引:9
|
作者
McAvoy, Alex [1 ,2 ]
Kates-Harbeck, Julian [3 ]
Chatterjee, Krishnendu [4 ]
Hilbe, Christian [5 ]
机构
[1] Univ Penn, Dept Math, Philadelphia, PA 19104 USA
[2] Univ Penn, Ctr Math Biol, Philadelphia, PA 19104 USA
[3] Harvard Univ, Dept Phys, Cambridge, MA USA
[4] IST Austria, Klosterneuburg, Austria
[5] Max Planck Inst Evolutionary Biol, Max Planck Res Grp Dynam Social Behav, Plon, Germany
来源
PNAS NEXUS | 2022年 / 1卷 / 04期
基金
欧洲研究理事会;
关键词
INFINITELY REPEATED GAMES; SOCIAL PREFERENCES; RANDOM SEARCH; COOPERATION; DYNAMICS; STRATEGIES; FAIRNESS; EFFICIENCY; EXTORTION; ANSWER;
D O I
10.1093/pnasnexus/pgac141
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Across many domains of interaction, both natural and artificial, individuals use past experience to shape future behaviors. The results of such learning processes depend on what individuals wish to maximize. A natural objective is one's own success. However, when two such "selfish" learners interact with each other, the outcome can be detrimental to both, especially when there are conflicts of interest. Here, we explore how a learner can align incentives with a selfish opponent. Moreover, we consider the dynamics that arise when learning rules themselves are subject to evolutionary pressure. By combining extensive simulations and analytical techniques, we demonstrate that selfish learning is unstable in most classical two-player repeated games. If evolution operates on the level of long-run payoffs, selection instead favors learning rules that incorporate social (other-regarding) preferences. To further corroborate these results, we analyze data from a repeated prisoner's dilemma experiment. We find that selfish learning is insufficient to explain human behavior when there is a trade-off between payoff maximization and fairness.
引用
收藏
页数:15
相关论文
共 50 条
  • [41] BAYESIAN LEARNING IN REPEATED NORMAL-FORM GAMES
    EICHBERGER, J
    GAMES AND ECONOMIC BEHAVIOR, 1995, 11 (02) : 254 - 278
  • [42] Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning
    Crandall, Jacob W.
    Goodrich, Michael A.
    MACHINE LEARNING, 2011, 82 (03) : 281 - 314
  • [43] Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning
    Jacob W. Crandall
    Michael A. Goodrich
    Machine Learning, 2011, 82 : 281 - 314
  • [44] The price of stability in selfish scheduling games
    Agussurja, Lucas
    Lau, Hoong Chuin
    Web Intelligence and Agent Systems, 2009, 7 (04): : 321 - 332
  • [45] Three Selfish Spanning Tree Games
    Gourves, Laurent
    Monnot, Jerome
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2008, 5385 : 465 - 476
  • [46] Selfish Caching Games on Directed Graphs
    Ma, Qian
    Yeh, Edmund
    Huang, Jianwei
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2021, 29 (02) : 709 - 722
  • [47] The price of stability in selfish scheduling games
    Agussurja, Lucas
    Lau, Hoong Chuin
    PROCEEDINGS OF THE IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY (IAT 2007), 2007, : 305 - +
  • [48] Bin Packing Games with Selfish Items
    Epstein, Leah
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 8 - 21
  • [49] Selfish colorful bin packing games
    Bilo, Vittorio
    Cellinese, Francesco
    Melideo, Giovanna
    Monaco, Gianpiero
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (03) : 610 - 635
  • [50] Selfish colorful bin packing games
    Vittorio Bilò
    Francesco Cellinese
    Giovanna Melideo
    Gianpiero Monaco
    Journal of Combinatorial Optimization, 2020, 40 : 610 - 635