The average covering tree value for directed graph games

Anna Khmelnitskaya*, Ozer Selcuktu, A.J.J. Talman

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

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.
Original languageEnglish
Pages (from-to)315-333
JournalJournal of Combinatorial Optimization
Volume39
Issue number2
DOIs
Publication statusPublished - Feb 2020

Fingerprint

Directed graphs
Directed Graph
Covering
Game
Communication
Dominance Relation
Gravitation
Shapley Value
Solution Concepts
Rooted Trees
Single valued
Undirected Graph
Convexity
Gravity
Analogue
Graph in graph theory

Keywords

  • TU game
  • directed communication structure
  • marginal contribution vector
  • Myerson value
  • average tree solution
  • stability

Cite this

Khmelnitskaya, Anna ; Selcuktu, Ozer ; Talman, A.J.J. / The average covering tree value for directed graph games. In: Journal of Combinatorial Optimization. 2020 ; Vol. 39, No. 2. pp. 315-333.
@article{df006318c4d74ab2ab07a9c8a90a4b3a,
title = "The average covering tree value for directed graph games",
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.",
keywords = "TU game, directed communication structure, marginal contribution vector, Myerson value, average tree solution, stability",
author = "Anna Khmelnitskaya and Ozer Selcuktu and A.J.J. Talman",
year = "2020",
month = "2",
doi = "10.1007/s10878-019-00471-5",
language = "English",
volume = "39",
pages = "315--333",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",
number = "2",

}

The average covering tree value for directed graph games. / Khmelnitskaya, Anna; Selcuktu, Ozer; Talman, A.J.J.

In: Journal of Combinatorial Optimization, Vol. 39, No. 2, 02.2020, p. 315-333.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - The average covering tree value for directed graph games

AU - Khmelnitskaya, Anna

AU - Selcuktu, Ozer

AU - Talman, A.J.J.

PY - 2020/2

Y1 - 2020/2

N2 - 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.

AB - 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.

KW - TU game

KW - directed communication structure

KW - marginal contribution vector

KW - Myerson value

KW - average tree solution

KW - stability

U2 - 10.1007/s10878-019-00471-5

DO - 10.1007/s10878-019-00471-5

M3 - Article

VL - 39

SP - 315

EP - 333

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 2

ER -