Abstract
Electronic communication allows interactions to take place over great distances. We build an agent-based model to explore whether networks that do not rely on geographic proximity can support cooperation as well as local interactions can. Adaptive agents play a four-move Prisoner's Dilemma game, where an agent's strategy specifies the probability of cooperating on the first move, and the probability of cooperating contingent on the partner's previous choice. After playing with four others, an agent adjusts its strategy so that more successful strategies are better represented in the succeeding round. The surprising result is that if the pattern of interactions is selected at random, but is persistent over time, cooperation emerges just as strongly as it does when interactions are geographically local. This has implications for both research on social dynamics, and for the prospects for building social capital in the modern age.
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.
