A characterization of the average tree solution for cycle-free graph games

D. Mishra, A.J.J. Talman

Research output: Contribution to journalArticleScientificpeer-review

234 Downloads (Pure)

Abstract

For the class of tree games, a new solution called the average tree solution has been proposed recently. We provide a characterization of this solution. This characterization underlines an important difference, in terms of symmetric treatment of the agents, between the average tree solution and the Myerson value for the class of tree games.
Original languageEnglish
Pages (from-to)105-111
JournalInternational Journal of Game Theory
Volume39
Issue number1-2
Publication statusPublished - 2010

Fingerprint

Game
Cycle
Graph in graph theory
Values
Game tree
Graph
Class
Myerson value

Cite this

@article{6cab0e52fe0944288df604d0a3f8bd49,
title = "A characterization of the average tree solution for cycle-free graph games",
abstract = "For the class of tree games, a new solution called the average tree solution has been proposed recently. We provide a characterization of this solution. This characterization underlines an important difference, in terms of symmetric treatment of the agents, between the average tree solution and the Myerson value for the class of tree games.",
author = "D. Mishra and A.J.J. Talman",
note = "Appeared earlier as CentER DP 2009-17",
year = "2010",
language = "English",
volume = "39",
pages = "105--111",
journal = "International Journal of Game Theory",
issn = "0020-7276",
publisher = "Springer Verlag",
number = "1-2",

}

A characterization of the average tree solution for cycle-free graph games. / Mishra, D.; Talman, A.J.J.

In: International Journal of Game Theory, Vol. 39, No. 1-2, 2010, p. 105-111.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A characterization of the average tree solution for cycle-free graph games

AU - Mishra, D.

AU - Talman, A.J.J.

N1 - Appeared earlier as CentER DP 2009-17

PY - 2010

Y1 - 2010

N2 - For the class of tree games, a new solution called the average tree solution has been proposed recently. We provide a characterization of this solution. This characterization underlines an important difference, in terms of symmetric treatment of the agents, between the average tree solution and the Myerson value for the class of tree games.

AB - For the class of tree games, a new solution called the average tree solution has been proposed recently. We provide a characterization of this solution. This characterization underlines an important difference, in terms of symmetric treatment of the agents, between the average tree solution and the Myerson value for the class of tree games.

M3 - Article

VL - 39

SP - 105

EP - 111

JO - International Journal of Game Theory

JF - International Journal of Game Theory

SN - 0020-7276

IS - 1-2

ER -