Loading...
The average covering tree value for directed graph games
Khmelnitskaya,Anna Selcuktu,Ozer Talman,A.J.J.
Khmelnitskaya,Anna
Selcuktu,Ozer
Talman,A.J.J.
Abstract
We introduce a single-valued solution concept, the so-called average covering tree value, for the class of transferable utility games with limited communication structure represented by a directed graph. The solution is the average of the marginal contribution vectors corresponding to all covering trees of the directed graph. The covering trees of a directed graph are those (rooted) trees on the set of players that preserve the dominance relations between the players prescribed by the directed graph. The average covering tree value is component efficient, and under a particular convexity-type condition it is stable. For transferable utility games with complete communication structure the average covering tree value equals to the Shapley value of the game. If the graph is the directed analog of an undirected graph the average covering tree value coincides with the gravity center solution.
Description
Publisher Copyright: © 2019, The Author(s).
Date
2020-02
Journal Title
Journal ISSN
Volume Title
Publisher
Files
Loading...
JCO39.pdf
Adobe PDF, 428 KB
Research Projects
Organizational Units
Journal Issue
Keywords
TU game, directed communication structure, marginal contribution vector, Myerson value, average tree solution, stability, C71 - Cooperative Games
Citation
Khmelnitskaya, A, Selcuktu, O & Talman, A J J 2020, 'The average covering tree value for directed graph games', Journal of Combinatorial Optimization, vol. 39, no. 2, pp. 315-333. https://doi.org/10.1007/s10878-019-00471-5
License
info:eu-repo/semantics/openAccess