Games with Graph Restricted Communication and Levels Structure of Cooperation

Vista senzilla d'ítem
dc.contributor.authorTejada, Oriol
dc.contributor.authorÁlvarez-Mozos, Mikel
dc.date.accessioned2017-07-19T11:41:42Z
dc.date.available2017-07-19T11:41:42Z
dc.date.issued2017
dc.date.updated2017-07-19T11:41:42Z
dc.description.abstractWe 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.
dc.format.extent28 p.
dc.format.mimetypeapplication/pdf
dc.identifier.issn1136-8365
dc.identifier.urihttps://hdl.handle.net/2445/114072
dc.language.isoeng
dc.publisherUniversitat de Barcelona. Facultat d'Economia i Empresa
dc.relation.ispartofUB Economics – Working Papers, 2017, E17/363
dc.relation.ispartofseries[WP E-Eco17/363]
dc.rightscc-by-nc-nd, (c) Tejada et al., 2017
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/
dc.sourceUB Economics – Working Papers [ERE]
dc.subject.classificationCooperative games (Mathematics)
dc.subject.classificationGraphic methods
dc.subject.classificationResource allocation
dc.subject.otherJocs cooperatius (Matemàtica)
dc.subject.otherMètodes gràfics
dc.subject.otherAssignació de recursos
dc.titleGames with Graph Restricted Communication and Levels Structure of Cooperation
dc.typeinfo:eu-repo/semantics/workingPaper

Fitxers

Paquet original

Mostrant 1 - 1 de 1
Miniatura
Nom:
E17-363_Tejada_Games.pdf
Mida:
493.26 KB
Format:
Adobe Portable Document Format
Descarregar

Col·leccions

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