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

D. Mishra; A.J.J. Talman

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

D. Mishra
, A.J.J. Talman

Research output: Contribution to journal › Article › Scientific › peer-review

17 Citations (Scopus)

380 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 language	English
Pages (from-to)	105-111
Journal	International Journal of Game Theory
Volume	39
Issue number	1-2
Publication status	Published - 2010

Access to Document

Avtree rev 2

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",

}

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

SN - 0020-7276

VL - 39

SP - 105

EP - 111

JO - International Journal of Game Theory

JF - International Journal of Game Theory

IS - 1-2

ER -

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

Abstract

Access to Document

Fingerprint

Cite this