Dijous 11 de juny, el Dipòsit Digital no estarà operatiu de 15:00 a 17:00 h per tasques de manteniment. Disculpeu les molèsties.
El jueves 11 de Junio, el Dipòsit Digital no estará operativo de 15:00 a 17:00 h debido a tareas de mantenimiento. Disculpen las molestias.
Thursday, Jun 11th, the Digital Repository will be unavailable due to a system update.

Files

E17-363_Tejada_Games.pdf (493.26 KB)

Document type

Working paper

Publication date

2017

Publication license

cc-by-nc-nd, (c) Tejada et al., 2017
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/114072

Games with Graph Restricted Communication and Levels Structure of Cooperation

Journal Title

Authors

Director/Tutor

Journal ISSN

Volume Title

Related resource

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.

Subject

Cooperative games (Mathematics), Graphic methods, Resource allocation

Subject (English)

Jocs cooperatius (Matemàtica), Mètodes gràfics, Assignació de recursos

Citation

Collections

UB Economics – Working Papers [ERE]
Documents de treball (Matemàtica Econòmica, Financera i Actuarial)

Citation

TEJADA, Oriol and ÁLVAREZ-MOZOS, Mikel. Games with Graph Restricted Communication and Levels Structure of Cooperation. UB Economics – Working Papers. 2017. Vol.  E17/363. ISSN 1136-8365. [consulted: 10 of June of 2026]. Available at: https://hdl.handle.net/2445/114072

Export metadata

JSON - METS

Share record