Abstract
(1976) introduced an allocation for minimum cost spanning tree gameswhich belongs to the core. However Bird allocation fails to satisfy cost monotonicity. (2004) by constructing a new allocation, showed that it is possible to achieve core selection and cost monotonicity on minimum cost spanning tree games. This paper proposes a new class of parametric allocations. It shows that these rules are core selection and satisfy many other attractive properties. It also provides a necessary and sufficient condition on the parameter for cost monotonicity. Moreover it is shown that the Bird allocation and the Dutta-Kar allocation are two extreme points of this family.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bergantinos G. and J. J. Vidal-Puga (2007a). A fair rule in minimum cost spanning tree problems; Journal of Economic Theory 137: 326–352
Bergantinos G. and J. J. Vidal-Puga (2007b). The optimistic TU game in minimum cost spanning tree problems; International Journal of Game Theory 36: 223–239
Bergantinos G. and A. Kar (2008). Obligation rules; Working paper series — Centre for Development Economics, Delhi School of Economics, University of Delhi, India
Bird C.G. (1976). On cost allocation for a spanning tree: A game theoretic approach; Networks 6: 335–350
Dutta B. and A. Kar (2004). Cost monotonicity and core selection on minimum cost spanning tree games; Games and Economic Behavior 48: 223–248
Feltkamp V., S. H. Tijs and S. Muto (1994). Birds tree allocation revisited; CentER, DP 9435, Tilburg University, Tilburg, The Netherlands
Granot D. and G. Huberman (1981). Minimum cost spanning tree games; Math Programming 21: 1–18
Kar A. (2002). Axiomatization of the Shapley value on minimum cost spanning tree games; Games and Economic Behavior 38: 265–277
Kruskal J. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem; Proceedings of the American Mathematical Society 7: 48–50
Megiddo N. (1978). Computational complexity of the game theory approach to cost allocation for a tree; Math. Oper. Res. 3: 189–196
Shapley L. S. (1953). A value for n-person games; ‘Contributions to the Theory of Games II’ (H. Kuhn and A. Tucker Eds.); Princeton University Press, Princeton NJ: 307–317
Tijs, S., R. Branzei, S. Moretti and H. Norde (2006). Obligation rules for minimum cost spanning tree situations and their monotonicity properties; European Journal of Operational Research 175: 121–134
Ozsoy H. (2006). A characterization of Bird’s rule; Available at: http://www.owlnet.rice.edu/∼ozsoy/
Prim R. C. (1957). Shortest connection network and some generalization; Bell System Tech. Journal 36; 1389–1401
Young H. (1994). Cost allocation, ‘Handbook of Game Theory with Economic Applications’ (R. Aumann and S. Hart Eds.); North Holland
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Italia
About this paper
Cite this paper
Kar, A. (2010). Allocation through Reduction on Minimum Cost Spanning Tree Games. In: Basu, B., Chakravarty, S.R., Chakrabarti, B.K., Gangopadhyay, K. (eds) Econophysics and Economics of Games, Social Choices and Quantitative Techniques. New Economic Windows. Springer, Milano. https://doi.org/10.1007/978-88-470-1501-2_32
Download citation
DOI: https://doi.org/10.1007/978-88-470-1501-2_32
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-1500-5
Online ISBN: 978-88-470-1501-2
eBook Packages: Business and EconomicsEconomics and Finance (R0)