Subgames within Large Games and the Heuristic of Imitation
We study repeated normal form games where the number of players is large. We argue that it is interesting to look at such games as being divided into subgames, each of which we call a neighbourhood. The structure of such a game is given by a graph G whose nodes are players and edges denote visibilit...
|Published in:||Studia logica : an international journal for symbolic logic, Vol. 102, No. 2 (2014), p. 361-388|
|Other Involved Persons:|
|Item Description:||Copyright: © Springer Science+Business Media 2014|
|Other Editions:||Show all 2 Editions|
|QR Code:||Show QR Code|
Studia logica : an international journal for symbolic logic, Vol. 102, No. 2 (2014), p. 361-388