The Shapley Value for Airport and Irrigation Games
In this paper cost sharing problems are considered. We focus on problems on a rooted tree, we call these problems cost-tree problems, and on the induced transferable utility cooperative games, we call these games irrigation games. A formal notion of irrigation games is introduced, and the characterization of the class of these games is provided. The well-known class of airport games (Littlechild and Thompson, 1977) is a subclass of irrigation games. The Shapley value (Shapley, 1953) is probably the most popular solution concept for transferable utility cooperative games. Dubey (1982) and Moulin and Shenker (1992) show respectively, that Shapley's (Shapley, 1953) and Young (1985)'s axiomatizations of the Shapley value are valid on the class of airport games. In this paper we extend Dubey (1982)'s and Moulin and Shenker (1992)'s results to the class of irrigation games, that is, we provide two characterizations of the Shapley value for cost sharing problems given on a rooted tree. In our characterization results we relate the TU games terminologies to the cost sharing terminologies, so we bridge between the two fields.
|Date of creation:||Feb 2012|
|Contact details of provider:|| Postal: 1112 Budapest, Budaorsi ut 45.|
Phone: (+36-1) 309-2652
Fax: (36-1) 319-3136
Web page: http://econ.core.hu
More information through EDIRC
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.:
- van den Brink, J.R., 1999.
"An Axiomatization of the Shapley Value Using a Fairness Property,"
1999-120, Tilburg University, Center for Economic Research.
- René van den Brink, 2002. "An axiomatization of the Shapley value using a fairness property," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(3), pages 309-319.
- Granot, D & Maschler, M & Owen, G & Zhu, W.R., 1996. "The Kernel/Nucleolus of a Standard Tree Game," International Journal of Game Theory, Springer;Game Theory Society, vol. 25(2), pages 219-44.
- Aadland, David & Kolpin, Van, 1998. "Shared irrigation costs: An empirical and axiomatic analysis," Mathematical Social Sciences, Elsevier, vol. 35(2), pages 203-218, March.
- S. H. Tijs & M. Koster & E. Molina & Y. Sprumont, 2002.
"Sharing the cost of a network: core and core allocations,"
International Journal of Game Theory,
Springer;Game Theory Society, vol. 30(4), pages 567-599.
- Koster, M.A.L. & Molina, E. & Sprumont, Y. & Tijs, S.H., 2001. "Sharing the cost of a network : Core and core allocations," Other publications TiSEM 20f62f3f-75ba-4fcd-abdc-a, Tilburg University, School of Economics and Management.
- S.C. Littlechild & G.F. Thompson, 1977. "Aircraft Landing Fees: A Game Theory Approach," Bell Journal of Economics, The RAND Corporation, vol. 8(1), pages 186-204, Spring.
- William Thomson, 2007. "Cost allocation and airport problems," RCER Working Papers 537, University of Rochester - Center for Economic Research (RCER).
- Chun, Youngsub, 1991. "On the Symmetric and Weighted Shapley Values," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(2), pages 183-90.
- Moulin, Herve & Shenker, Scott, 1992. "Serial Cost Sharing," Econometrica, Econometric Society, vol. 60(5), pages 1009-37, September.
- Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
- S. C. Littlechild & G. Owen, 1973. "A Simple Expression for the Shapley Value in a Special Case," Management Science, INFORMS, vol. 20(3), pages 370-372, November.
When requesting a correction, please mention this item's handle: RePEc:has:discpr:1207. 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: (Adrienn Foldi)
If references are entirely missing, you can add them using this form.