A Strategic Implementation of the Average Tree Solution for Cycle-Free Graph Games

This discussion paper led to a publication in the 'Journal of Economic Theory', 2014, 148, 2737-2748.<P> 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.