The Shapley Value of Digraph Games

Krishna Khatri

Papers from arXiv.org

Abstract: In this paper the Shapley value of digraph (directed graph) games are considered. Digraph games are transferable utility (TU) games with limited cooperation among players, where players are represented by nodes. A restrictive relation between two adjacent players is established by a directed line segment. Directed path, connecting the initial player with the terminal player, form the coalition among players. A dominance relation is established between players and this relation determines whether or not a player wants to cooperate. To cooperate, we assume that a player joins a coalition where he/she is not dominated by any other players.The Shapley value is defined as the average of marginal contribution vectors corresponding to all permutations that do not violate the subordination of players. The Shapley value for cyclic digraph games is calculated and analyzed. For a given family of characteristic functions, a quick way to calculate Shapley values is formulated.

Date: 2017-01, Revised 2017-06
New Economics Papers: this item is included in nep-gth and nep-hpe
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/1701.01677 Latest 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:arx:papers:1701.01677

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().