Smale strategies for network prisoner's dilemma games

DOI10.3934/jdg.2015.2.141zbMath1360.91025arXiv1503.08481OpenAlexW3102580469MaRDI QIDQ900838

Michel Benaïm, Kashi Behrstock, Morris W. Hirsch

Publication date: 23 December 2015

Published in: Journal of Dynamics and Games (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.08481

zbMATH Keywords

differential inclusionsstochastic approximationapproachabilityrepeated prisoner dilemma

Mathematics Subject Classification ID

Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Multistage and repeated games (91A20)

Related Items (3)

Smale strategies for the \(n\)-person iterated prisoner's dilemma ⋮ Almost sure exponential stability of two-strategy evolutionary games with multiplicative noise ⋮ A Robust Saturated Strategy for $n$-Player Prisoner's Dilemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analog of the minimax theorem for vector payoffs
• Asymptotic pseudotrajectories and chain recurrent flows, with applications
• Approachability, regret and calibration: implications and equivalences
• The Evolution of Cooperation
• Stochastic Approximations of Set-Valued Dynamical Systems: Convergence with Positive Probability to an Attractor
• The Prisoner's Dilemma and Dynamical Systems Associated to Non-Cooperative Games
• A Dynamical System Approach to Stochastic Approximations
• Stochastic Approximations and Differential Inclusions

This page was built for publication: Smale strategies for network prisoner's dilemma games