PD Games on Networks
Allen Wilhite
No 20, Computing in Economics and Finance 2005 from Society for Computational Economics
Abstract:
We tend to interact with same people, day after day. Might this affect our behavior? In an abstract fashion, we look at this question. To model this repeated interaction with a small subset of the entire population we place agents on the nodes of a network and have them play a prisoners’ dilemma game exclusively with their neighbors. We then alter the payoffs of the game and the topology of the network to see if, when, and to what degree cooperation survives. We find widely divergent aggregate decisions across networks and across payoffs. But, there is commonality as well. It seems clear that some networks, or some organizational structures, are more conducive to fostering cooperation
Keywords: PD games; networks (search for similar items in EconPapers)
JEL-codes: C73 (search for similar items in EconPapers)
Date: 2005-11-11
New Economics Papers: this item is included in nep-gth, nep-net and nep-soc
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://cas.uah.edu/wilhitea/papers/pdgames.pdf main text (application/pdf)
Our link check indicates that this URL is bad, the error code is: 500 Can't connect to cas.uah.edu:80 (A connection attempt failed because the connected party did not properly respond after a period of time, or established connection failed because connected host has failed to respond.)
http://repec.org/sce2005/up.21006.1103564743.pdf (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:sce:scecf5:20
Access Statistics for this paper
More papers in Computing in Economics and Finance 2005 from Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum ().