Non-Trivial Solutions to the N-Person Prisoners’ Dilemma
نویسندگان
چکیده
We have developed a new agent-based simulation tool to model social dilemmas for the case of a large number of not necessarily rational decision-makers (Szilagyi and Szilagyi, 2000). The combination of various personalities with stochastic learning makes it possible to simulate the multi-person Prisoners’ Dilemma game for realistic situations. A variety of personality profiles and their arbitrary combinations can be represented, including agents whose probability of cooperation changes by an amount proportional to its reward from the environment. For the case of such agents the game has non-trivial but remarkably regular solutions. We discuss a method and present an algorithm for making accurate advance predictions of these solutions. We also propose our model as a viable approach for the study of populations of cells, organisms, groups, organizations, communities, and societies. It may lead to better understanding of the evolution of cooperation in living organisms, international alliances, sports teams, and large organizations. Copyright # 2002 John Wiley & Sons, Ltd.
منابع مشابه
An Investigation of N-person Prisoners' Dilemmas
This paper is an attempt to systematically present the problem of various N-person Prisoners’ Dilemma games and some of their possible solutions. 13 characteristics of the game are discussed. The role of payoff curves, personalities, and neighborhood is investigated. Experiments are performed with a new simulation tool for multi-agent Prisoners’ Dilemma games. Investigations of realistic situat...
متن کاملInvestigation of N-Person Games by Agent-Based Modeling
The recent developments in agent-based modeling of several N-person games are reviewed and some features of the author’s software tools as well as some applications are described. After explaining the transition from two-person to N-person games, the classification and properties of N-person games, our software tools, and agent personalities, the following N-person games are considered: prisone...
متن کاملCooperation in a Repeated Prisoners’ Dilemma with Ostracism
The unique Nash equilibrium of the finitely repeated n-person Prisoners’ Dilemma calls for defection in all rounds. One way to enforce cooperation in groups is ostracism: players who defect are expelled. If the group’s members prefer not to diminish its size, ostracism hurts the legitimate members of the group as well as the outcast. putting the credibility of the threat in doubt. Nonetheless, ...
متن کاملThe prisoners may be in two minds
Recognise that people have many, possibly conflicting, aspects to their personality. We hypothesise that each separate characteristic of a personality may be treated as an independent player in a non-zero sum many player game. This idea is applied to the two person Prisoners’ Dilemma as an introductory example. We assume each prisoner has a “mercenary” characteristic as well as an “altruistic” ...
متن کاملCooperation in a sequential N-person prisoner’s dilemma: The role of information and reciprocity
We investigate experimentally the possibility of cooperation in a sequential prisoners' dilemma game under the conditions identified by Nishihara (1997). He shows for (a subclass of) n-person prisoners' dilemma games that when players move sequentially, but the order of moves is not known, full cooperation can be attained in a Nash equilibrium under an information structure allowing for trigger...
متن کامل