Slow emergence of cooperation for win-stay lose-shift on trees (Q2384146): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2018288672 / rank | |||
Normal rank |
Revision as of 22:25, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Slow emergence of cooperation for win-stay lose-shift on trees |
scientific article |
Statements
Slow emergence of cooperation for win-stay lose-shift on trees (English)
0 references
20 September 2007
0 references
The paper under review considers a group of agents on a graph who repeatedly play the prisoner's dilemma (PD) game with their neighbors. The players here apply the win-stay lose-shift strategy. The authors here analyse the rate of convergence to cooperation (i.e. to the all-cooperate state) in terms of the size and structure of the graph. They show that on some expander graphs and bounded-degree trees, this iterated PD game exhibits an exponentially slow converge to cooperation.
0 references
games on graphs
0 references
learning
0 references
prisoner's dilemma game
0 references
win-stay lose-shift
0 references
oriented percolation
0 references
emergence of cooperation
0 references