| | |
| | |
Stat |
Members: 3645 Articles: 2'500'096 Articles rated: 2609
19 April 2024 |
|
| | | |
|
Article overview
| |
|
Evolutionary Prisoner's Dilemma in Random Graphs | O. Durán
; R. Mulet
; | Date: |
15 May 2003 | Subject: | Statistical Mechanics; Disordered Systems and Neural Networks | cond-mat.stat-mech cond-mat.dis-nn | Abstract: | We study an evolutionary version of the spatial prisoner’s dilemma game, where the agents are placed in a random graph. For lattices with fixed connectivity, $alpha$, we show that for low values of $alpha$ the final density of cooperating agents depends on the initial conditions, while it does not depend for high connectivity lattices. We fully characterized the phase diagram of the system, using both, extensive numerical simulations and analytical computations. It is shown that two different behaviors are well defined: a Nash equilibrium one, where the density of cooperating agents $
ho_c$ is fixed, and a non-stationary one, where $
ho_c$ fluctuates in time. Moreover we study lattices with fluctuating connectivities and find that the phase diagram previously developed looses its meaning. In fact, multiple transitions appear and only one regime may be defined. This regime is completely characterized by a non stationary state where the density of cooperating agents varies in time. | Source: | arXiv, cond-mat/0305353 | 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:
| |