Standard

The average covering tree value for directed graph games. / Khmelnitskaya, Anna; Selçuk, Özer; Talman, Dolf.

в: Journal of Combinatorial Optimization, Том 39, № 2, 01.02.2020, стр. 315–333.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Khmelnitskaya, A, Selçuk, Ö & Talman, D 2020, 'The average covering tree value for directed graph games', Journal of Combinatorial Optimization, Том. 39, № 2, стр. 315–333. https://doi.org/10.1007/s10878-019-00471-5

APA

Khmelnitskaya, A., Selçuk, Ö., & Talman, D. (2020). The average covering tree value for directed graph games. Journal of Combinatorial Optimization, 39(2), 315–333. https://doi.org/10.1007/s10878-019-00471-5

Vancouver

Khmelnitskaya A, Selçuk Ö, Talman D. The average covering tree value for directed graph games. Journal of Combinatorial Optimization. 2020 Февр. 1;39(2):315–333. https://doi.org/10.1007/s10878-019-00471-5

Author

Khmelnitskaya, Anna ; Selçuk, Özer ; Talman, Dolf. / The average covering tree value for directed graph games. в: Journal of Combinatorial Optimization. 2020 ; Том 39, № 2. стр. 315–333.

BibTeX

@article{f0fad25460ff46aeb647433e97d714d3,
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 = "s TU game, Directed communication structure, · Marginal contribution vector, Myerson value, Average tree solution, Stability, TU game, Directed communication structure, Marginal contribution vector, Myerson value, Average tree solution, STABILITY, Stability",
author = "Anna Khmelnitskaya and {\"O}zer Sel{\c c}uk and Dolf Talman",
note = "Khmelnitskaya, A., Sel{\c c}uk, {\"O}. & Talman, D. J Comb Optim (2020) 39: 315. https://doi.org/10.1007/s10878-019-00471-5",
year = "2020",
month = feb,
day = "1",
doi = "10.1007/s10878-019-00471-5",
language = "English",
volume = "39",
pages = "315–333",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Nature",
number = "2",

}

RIS

TY - JOUR

T1 - The average covering tree value for directed graph games

AU - Khmelnitskaya, Anna

AU - Selçuk, Özer

AU - Talman, Dolf

N1 - Khmelnitskaya, A., Selçuk, Ö. & Talman, D. J Comb Optim (2020) 39: 315. https://doi.org/10.1007/s10878-019-00471-5

PY - 2020/2/1

Y1 - 2020/2/1

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 - s TU game

KW - Directed communication structure

KW - · Marginal contribution vector

KW - Myerson value

KW - Average tree solution

KW - Stability

KW - TU game

KW - Directed communication structure

KW - Marginal contribution vector

KW - Myerson value

KW - Average tree solution

KW - STABILITY

KW - Stability

UR - http://www.scopus.com/inward/record.url?scp=85074695941&partnerID=8YFLogxK

UR - http://www.mendeley.com/research/average-covering-tree-value-directed-graph-games

UR - https://www.mendeley.com/catalogue/36bbf5b3-2e7b-3e9e-a3b1-25dbf154fdc4/

U2 - 10.1007/s10878-019-00471-5

DO - 10.1007/s10878-019-00471-5

M3 - Article

AN - SCOPUS:85074695941

VL - 39

SP - 315

EP - 333

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 2

ER -

ID: 49389758