Abstract
The Shapley value for directed graph (digraph) games, TU games with limited cooperation introduced by an arbitrary digraph prescribing the dominance relation among the players, is introduced. It is defined as the average of marginal contribution vectors corresponding to all permutations that do not violate the subordination of players. We assume that in order to cooperate players may join only coalitions containing no players dominating them. Properties of this solution are studied and a convexity type condition is provided that guarantees its stability with respect to an appropriately defined core concept. An axiomatization for cycle digraph games for which the digraphs are directed
cycles is obtained.
cycles is obtained.
| Original language | English |
|---|---|
| Place of Publication | Tilburg |
| Publisher | Operations research |
| Pages | 1-10 |
| Number of pages | 10 |
| Volume | 2014-064 |
| Publication status | Published - 22 Oct 2014 |
Publication series
| Name | CentER Discussion Paper |
|---|---|
| Volume | 2014-064 |
Keywords
- TU game
- Shapley value
- directed graph
- dominance structure
- core
- convexity