Please use this identifier to cite or link to this item:
Title: Games with Graph Restricted Communication and Levels Structure of Cooperation
Author: Tejada, Oriol
Álvarez-Mozos, Mikel
Keywords: Cooperative games (Mathematics)
Graphic methods
Resource allocation
Jocs cooperatius (Matemàtica)
Mètodes gràfics
Assignació de recursos
Issue Date: 2017
Publisher: Universitat de Barcelona. Facultat d'Economia i Empresa
Series/Report no: [WP E-Eco17/363]
Abstract: 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.
It is part of: UB Economics – Working Papers, 2017, E17/363
ISSN: 1136-8365
Appears in Collections:UB Economics – Working Papers [ERE]

Files in This Item:
File Description SizeFormat 
E17-363_Tejada_Games.pdf493.26 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons