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

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 characterization 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

MoreLess

Year of publication:	[2009]
Authors:	Mishra, Debasis
Other Persons:	Talman, Dolf (contributor)
Publisher:	[2009]: [S.l.] : SSRN
Subject:	Kooperatives Spiel \| Cooperative game \| Theorie \| Theory \| Shapley-Wert \| Shapley value \| Kommunikation \| Communication \| Gerechtigkeit \| Justice \| Transferierbarer Nutzen \| Transferable utility

freely available

Full text |

More access options

doi.org

Check Google Scholar

In German libraries (KVK)

I need help

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10012718484