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

Oriol Tejada and Mikel Álvarez-Mozos

Mathematical Social Sciences, 2018, vol. 93, issue C, 114-122

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.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489618300179
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:93:y:2018:i:c:p:114-122

DOI: 10.1016/j.mathsocsci.2018.02.005

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().