Simulations of assortative matching: complexity of cooperation emergence process
| dc.creator | Sobkowicz, Pawel | |
| dc.date | 2004-02-08 | |
| dc.date.accessioned | 2026-07-07T02:56:22Z | |
| dc.date.available | 2026-07-07T02:56:22Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0402222 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0402222 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/23295 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Populations and Evolution | |
| dc.title | Simulations of assortative matching: complexity of cooperation emergence process | |
| dc.type | text |