Thumbnail Image
Item

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

Mishra,D.
; 
Talman,A.J.J.
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.
Description
Appeared earlier as CentER DP 2009-17
Date
2010
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
avtree_rev_2.pdf
Adobe PDF, 104.49 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Mishra, D & Talman, A J J 2010, 'A characterization of the average tree solution for cycle-free graph games', International Journal of Game Theory, vol. 39, no. 1-2, pp. 105-111.
URI
https://hdl.handle.net/20.500.14602/52290
License
info:eu-repo/semantics/restrictedAccess
Embedded videos