Values for cooperative games over graphs and games with inadmissible coalitions

Ziv Hellman and Ron Peretz

Games and Economic Behavior, 2018, vol. 108, issue C, 22-36

Abstract: We suppose that players in a cooperative game are located within a graph structure, such as a social network or supply route, that limits coalition formation to coalitions along connected subsets within the graph. This in turn leads to a more general study of coalitional games in which there are arbitrary limitations on the collections of coalitions that may be formed. Within this context we define a generalisation of the Shapley value that is studied from an axiomatic perspective. The resulting ‘graph value’ (and ‘S-value’ in the general case) is endogenously asymmetric, with the automorphism group of the graph playing a crucial role in determining the relative values of players.

Keywords: Shapley value; Network games (search for similar items in EconPapers)
JEL-codes: C71 D46 D72 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825616301488
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:gamebe:v:108:y:2018:i:c:p:22-36

DOI: 10.1016/j.geb.2016.12.007

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().