Values for Cooperative Games over Graphs and Games With Inadmissible Coalitions

Ziv Hellman () and Ron Peretz
Additional contact information
Ziv Hellman: Bar-Ilan University

No 2015-04, Working Papers from Bar-Ilan University, Department of Economics

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)
Pages: 25 pages
Date: 2015-04
New Economics Papers: this item is included in nep-cdm, nep-gth, nep-hpe and nep-net
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://econ.biu.ac.il/sites/econ/files/working-papers/2015-04_0.pdf Working paper (application/pdf)

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:biu:wpaper:2015-04

Access Statistics for this paper

More papers in Working Papers from Bar-Ilan University, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Department of Economics ().