Amb motiu del tancament d'estiu, la validació de documents es reprendrà a partir del 28 d'agost de 2026. Disculpeu les molèsties.
Con motivo del cierre de verano, la validación de documentos se reanudará a partir del 28 de agosto de 2026. Disculpad las molestias
Due to the summer closure, document validation will resume starting August 28, 2026. We apologize for any inconvenience.

Files

679756.pdf (578.5 KB)

Document type

Article

Version

Accepted version

Publication date

2018

Publication license

cc-by-nc-nd (c) Elsevier B.V., 2018
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/121286

Graphs and (levels of) cooperation in games: Two ways how to allocate the surplus

Journal Title

Authors

Director/Tutor

Journal ISSN

Volume Title

Related resource

https://doi.org/10.1016/j.mathsocsci.2018.02.005

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 values 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 today's fully integrated societies.

Subject

Teoria de jocs, Economia matemàtica

Subject (English)

Game theory, Mathematical economics

Citation

Collections

Articles publicats en revistes (Matemàtica Econòmica, Financera i Actuarial)

Citation

TEJADA, Oriol and ÁLVAREZ-MOZOS, Mikel. Graphs and (levels of) cooperation in games: Two ways how to allocate the surplus. Mathematical Social Sciences. 2018. Vol. 93, num. May, pags. 114-122. ISSN 0165-4896. [consulted: 16 of August of 2026]. Available at: https://hdl.handle.net/2445/121286

Export metadata

JSON - METS

Share record