Abstract
Various settings of iterated prisoner's dilemma (IPD) games have been studied to examine the evolution of cooperation among players in the literature. In recent studies, players are often spatially placed in a network. Each player plays the IPD game against its neighbors, which are defined by connections between players in the network. As in the case of cellular IPD games in a two-dimensional lattice, the number of opponents is usually very small in network-based IPD games. In this paper, we examine the effect of the number of opponents on the evolution of cooperation through computational experiments using various networks. The main feature of our computational experiments is to randomly choose a pre-specified number of opponents for each player from its neighbors in one setting and from all players in another setting. In this manner, we examine a wide range of specifications of the number of opponents.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
