Rooted-tree solutions for tree games
In this paper, we study cooperative games with limited cooperation possibilities, represented by a tree on the set of agents. Agents in the game can cooperate if they are connected in the tree. We introduce natural extensions of the average (rooted)-tree solution (see [Herings, P., van der Laan, G., Talman, D., 2008. The average tree solution for cycle free games. Games and Economic Behavior 62, 77-92]): the marginalist tree solutions and the random tree solutions. We provide an axiomatic characterization of each of these sets of solutions. By the way, we obtain a new characterization of the average tree solution.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Debasis Mishra & A. Talman, 2010.
"A characterization of the average tree solution for tree games,"
International Journal of Game Theory,
Springer;Game Theory Society, vol. 39(1), pages 105-111, March.
- Debasis Mishra & Dolf Talman, 2009. "A Characterization of the average tree solution for tree games," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 09-08, Indian Statistical Institute, New Delhi, India.
- repec:spr:compst:v:65:y:2007:i:1:p:153-167 is not listed on IDEAS
- repec:hal:journl:halshs-00178916 is not listed on IDEAS
- Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2008.
"The average tree solution for cycle-free graph games,"
Other publications TiSEM
f243609c-2847-415f-ae52-1, Tilburg University, School of Economics and Management.
- Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
- HERINGS, P. Jean-Jacques & van der LAAN, Gerard & TALMAN, Dolf, "undated". "The average tree solution for cycle-free graph games," CORE Discussion Papers RP 2155, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Mishra, D. & Talman, A.J.J., 2009.
"A Characterization of the Average Tree Solution for Cycle-Free Graph Games,"
2009-17, Tilburg University, Center for Economic Research.
- Mishra, D. & Talman, A.J.J., 2010. "A characterization of the average tree solution for cycle-free graph games," Other publications TiSEM 6cab0e52-fe09-4428-8df6-0, Tilburg University, School of Economics and Management.
- Gabrielle Demange, 2004.
"On group stability in hierarchies and networks,"
- Michel Grabisch & Fabien Lange, 2007.
"Games on lattices, multichoice games and the shapley value: a new approach,"
Mathematical Methods of Operations Research,
Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(1), pages 153-167, February.
- Michel Grabisch & Fabien Lange, 2007. "Games on lattices, multichoice games and the Shapley value: a new approach," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00178916, HAL.
- Branzei, R. & Tijs, S. & Zarzuelo, J., 2009. "Convex multi-choice games: Characterizations and monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 198(2), pages 571-575, October.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:203:y:2010:i:2:p:404-408. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.