The Core of an Extended Tree Game: A New Characterisation
AbstractCost allocation problems on networks can be interpreted as cooperative games on a graph structure. In the classical standard tree game, the cost of a service delivered, by a source has to be allocated between homogeneous users at the vertices. But, modern networks have also the capacity to supply different (levels of) services. For example, a cable network that provides diff erent television standards. Users that choose different levels of service can not be treated equally. The extended tree game accounts for such differences between users. Here, players are characterised by their level of demand, consequently the implications on the cost structure of the problem can be considered. We show how an ET-game can be formulated as the sum of unanimity games. This observation enables us to directly calculate the weighted Shapley values and to identify the core of an ET-game.
Download InfoIf 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.
Bibliographic InfoPaper provided by Rheinisch-Westfälisches Institut für Wirtschaftsforschung, Ruhr-Universität Bochum, Universität Dortmund, Universität Duisburg-Essen in its series Ruhr Economic Papers with number 0212.
Length: 22 pages
Date of creation: Nov 2010
Date of revision:
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
This paper has been announced in the following NEP Reports:
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.:
- Koster, M.A.L., 1999. "Cost Sharing in Production Situations and Network Exploitation," Open Access publications from Tilburg University urn:nbn:nl:ui:12-80718, Tilburg University.
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001.
"Operations research games: A survey,"
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-305110, Tilburg University.
- Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 9(2), pages 139-199, December.
- Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May.
- Bjorndal, E. & Koster, M.A.L. & Tijs, S.H., 1999.
"Weighted Allocation Rules for Standard Fixed Tree Games,"
1999-79, Tilburg University, Center for Economic Research.
- Bjorndal, E. & Koster, M.A.L. & Tijs, S.H., 2004. "Weighted allocation rules for standard fixed tree games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-142601, Tilburg University.
- Monderer, Dov & Samet, Dov & Shapley, Lloyd S, 1992. "Weighted Values and the Core," International Journal of Game Theory, Springer, vol. 21(1), pages 27-39.
- Monderer, Dov & Samet, Dov, 2002. "Variations on the shapley value," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 54, pages 2055-2076 Elsevier.
- René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer, vol. 33(2), pages 349-364, November.
- Ehud Kalai & Dov Samet, 1983. "On Weighted Shapley Values," Discussion Papers 602, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Sharkey, W.W., 1991. "Network Models in Economics," Papers 69, Bell Communications - Economic Research Group.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sabine Weiler).
If references are entirely missing, you can add them using this form.