# name
Games with Graph Restricted Communication and Levels Structure of Cooperation

# metadata.dc.description.abstract[].value
We analyze surplus allocation problems where cooperation between agents is restricted both by a communication graph and by a sequence of embedded partitions of the agent set. For this type of problem, we define and characterize two new vàlues extending the Shapley value and the Banzhaf value respectively. Our results enable the axiomatic comparison between the two values and provide some basic insights for the analysis of fair resource allocation in nowadays fully integrated societies.

# metadata.dc.publisher[].value
Universitat de Barcelona. Facultat d'Economia i Empresa

# metadata.dc.relation.ispartof[].value
UB Economics – Working Papers, 2017, E17/363

# metadata.dc.title[].value
Games with Graph Restricted Communication and Levels Structure of Cooperation