Graph value for cooperative games

Ziv Hellman () and Ron Peretz

LSE Research Online Documents on Economics from London School of Economics and Political Science, LSE Library

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 paths within the graph. This leads to a generalisation of the Shapley value that is studied here from an axiomatic perspective. The resulting ‘graph value’ 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: D46 D72 (search for similar items in EconPapers)
Pages: 17 pages
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://eprints.lse.ac.uk/50073/ Open access version. (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:ehl:lserod:50073

Access Statistics for this paper

More papers in LSE Research Online Documents on Economics from London School of Economics and Political Science, LSE Library LSE Library Portugal Street London, WC2A 2HD, U.K.. Contact information at EDIRC.
Bibliographic data for series maintained by LSERO Manager ().