|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Simulations of assortative matching: complexity of cooperation emergence process | | Pawel Sobkowicz
; | | Date: |
8 Feb 2004 | | Subject: | Disordered Systems and Neural Networks; Populations and Evolution | cond-mat.dis-nn q-bio.PE | | Abstract: | The paper studies the emergence and stability of cooperative behavior in populations of agents who interact among themselves in Prisoner’s Dilemma games and who are allowed to choose their partners. The population is then subject to evolutionary pressures, based on individual payoffs from multiple encounters. A simple formula for signaling and recognition is introduced, which allows the agents to guess prospective partner strategy and to refuse the game if the predicted outcome is unfavorable. We present both algebraic formulation of the average payoffs and results of computer simulations of evolution of such society. The simulations result in surprising variety of behavior. We discuss possible interpretations of the results as well as relationship between artificial `computer time’ and real time of possible social and biological systems that the model might be applied to. | | Source: | arXiv, cond-mat/0402222 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER