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

Fecha de publicación

2018-04-05T08:08:54Z

2021-12-31T06:10:16Z

2018

2018-04-05T08:08:54Z

Resumen

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.

Tipo de documento

Artículo


Versión aceptada

Lengua

Inglés

Publicado por

Elsevier B.V.

Documentos relacionados

Versió postprint del document publicat a: https://doi.org/10.1016/j.mathsocsci.2018.02.005

Mathematical Social Sciences, 2018, vol. 93, num. May, p. 114-122

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

Citación recomendada

Esta citación se ha generado automáticamente.

Derechos

cc-by-nc-nd (c) Elsevier B.V., 2018

http://creativecommons.org/licenses/by-nc-nd/3.0/es

Este ítem aparece en la(s) siguiente(s) colección(ones)