A Characterization of the Average Tree Solution for Cycle-Free Graph Games

D. Mishra, A.J.J. Talman

Research output: Working paperDiscussion paperOther research output

211 Downloads (Pure)

Abstract

Herings et al. (2008) proposed a solution concept called the average tree solution for cycle-free graph games. We provide a characterization of the average tree solution for cycle-free graph games. The characteration underlines an important difference, in terms of symmetric treatment of agents, between the average tree solution and the Myerson value (Myerson, 1977) for cycle-free graph games.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages14
Volume2009-17
Publication statusPublished - 2009

Publication series

NameCentER Discussion Paper
Volume2009-17

Keywords

  • average tree solution
  • graph games
  • Myerson value
  • Shapley value

Cite this

Mishra, D., & Talman, A. J. J. (2009). A Characterization of the Average Tree Solution for Cycle-Free Graph Games. (CentER Discussion Paper; Vol. 2009-17). Tilburg: Operations research.
Mishra, D. ; Talman, A.J.J. / A Characterization of the Average Tree Solution for Cycle-Free Graph Games. Tilburg : Operations research, 2009. (CentER Discussion Paper).
@techreport{36779266a43441a08d30febff875cedd,
title = "A Characterization of the Average Tree Solution for Cycle-Free Graph Games",
abstract = "Herings et al. (2008) proposed a solution concept called the average tree solution for cycle-free graph games. We provide a characterization of the average tree solution for cycle-free graph games. The characteration underlines an important difference, in terms of symmetric treatment of agents, between the average tree solution and the Myerson value (Myerson, 1977) for cycle-free graph games.",
keywords = "average tree solution, graph games, Myerson value, Shapley value",
author = "D. Mishra and A.J.J. Talman",
note = "Subsequently published in International Journal of Game Theory, 2010 Pagination: 14",
year = "2009",
language = "English",
volume = "2009-17",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Mishra, D & Talman, AJJ 2009 'A Characterization of the Average Tree Solution for Cycle-Free Graph Games' CentER Discussion Paper, vol. 2009-17, Operations research, Tilburg.

A Characterization of the Average Tree Solution for Cycle-Free Graph Games. / Mishra, D.; Talman, A.J.J.

Tilburg : Operations research, 2009. (CentER Discussion Paper; Vol. 2009-17).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - A Characterization of the Average Tree Solution for Cycle-Free Graph Games

AU - Mishra, D.

AU - Talman, A.J.J.

N1 - Subsequently published in International Journal of Game Theory, 2010 Pagination: 14

PY - 2009

Y1 - 2009

N2 - Herings et al. (2008) proposed a solution concept called the average tree solution for cycle-free graph games. We provide a characterization of the average tree solution for cycle-free graph games. The characteration underlines an important difference, in terms of symmetric treatment of agents, between the average tree solution and the Myerson value (Myerson, 1977) for cycle-free graph games.

AB - Herings et al. (2008) proposed a solution concept called the average tree solution for cycle-free graph games. We provide a characterization of the average tree solution for cycle-free graph games. The characteration underlines an important difference, in terms of symmetric treatment of agents, between the average tree solution and the Myerson value (Myerson, 1977) for cycle-free graph games.

KW - average tree solution

KW - graph games

KW - Myerson value

KW - Shapley value

M3 - Discussion paper

VL - 2009-17

T3 - CentER Discussion Paper

BT - A Characterization of the Average Tree Solution for Cycle-Free Graph Games

PB - Operations research

CY - Tilburg

ER -

Mishra D, Talman AJJ. A Characterization of the Average Tree Solution for Cycle-Free Graph Games. Tilburg: Operations research. 2009. (CentER Discussion Paper).