论文信息 - Smale Strategies for Network Prisoner's Dilemma Games

Smale Strategies for Network Prisoner's Dilemma Games

Smale’s approach [13] to the classical two-players repeated Prisoner’s Dilemma game is revisited here for N-players and Network games in the framework of Blackwell’s approachability, stochastic approximations and differential inclusions. MSC: 91A06, 91A26, 62L20, 34G25, 37B25,

[1] M. Benaïm. A Dynamical System Approach to Stochastic Approximations , 1996 .

[2] Gregory Roth,et al. Stochastic Approximations of Set-Valued Dynamical Systems: Convergence with Positive Probability to an Attractor , 2009, Math. Oper. Res..

[3] Vianney Perchet,et al. Approachability, Regret and Calibration; implications and equivalences , 2013, ArXiv.

[4] W. Hamilton,et al. The evolution of cooperation. , 1984, Science.

[5] D. Blackwell. An analog of the minimax theorem for vector payoffs. , 1956 .

[6] Smale Strategies for Prisoner's Dilemma Type Games , 2004 .

[7] S. Smale. The Prisoner's Dilemma and Dynamical Systems Associated to Non-Cooperative Games , 1980 .

[8] Carol Barner-Barry,et al. The Evolution of Cooperation Robert Axelrod New York: Basic Books, Inc., 1984 , 1985 .

[9] G. Hardin,et al. The Tragedy of the Commons , 1968, Green Planet Blues.

[10] M. Benaïm. Dynamics of stochastic approximation algorithms , 1999 .

[11] M. Hirsch,et al. Asymptotic pseudotrajectories and chain recurrent flows, with applications , 1996 .

[12] Josef Hofbauer,et al. Stochastic Approximations and Differential Inclusions , 2005, SIAM J. Control. Optim..