A strategic implementation of the Average Tree solution for cycle-free graph games |
| |
Authors: | René van den Brink Gerard van der Laan Nigel Moes |
| |
Institution: | Department of Econometrics and Tinbergen Institute, VU University Amsterdam, De Boelelaan 1105, 1081 HV Amsterdam, The Netherlands |
| |
Abstract: | In this note we provide a strategic implementation of the Average Tree solution for zero-monotonic cycle-free graph games. That is, we propose a non-cooperative mechanism of which the unique subgame perfect equilibrium payoffs correspond to the average hierarchical outcome of the game. This mechanism takes into account that a player is only able to communicate with other players (i.e., to make proposals about a division of the surplus of cooperation) when they are connected in the graph. |
| |
Keywords: | C71 C72 |
本文献已被 ScienceDirect 等数据库收录! |
|