Bergantiños, Gustavo and VidalPuga, Juan (2012): Characterization of monotonic rules in minimum cost spanning tree problems.

PDF
MPRA_paper_39994.pdf Download (344kB)  Preview 
Abstract
We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity over cost and population. We also prove that the set of allocations induced by the family coincides with the irreducible core.
Item Type:  MPRA Paper 

Original Title:  Characterization of monotonic rules in minimum cost spanning tree problems 
Language:  English 
Keywords:  Cost sharing, minimum cost spanning tree problems, monotonicity, irreducible core 
Subjects:  C  Mathematical and Quantitative Methods > C7  Game Theory and Bargaining Theory > C71  Cooperative Games 
Item ID:  39994 
Depositing User:  Juan VidalPuga 
Date Deposited:  10 Jul 2012 15:53 
Last Modified:  27 Mar 2017 20:50 
References:  Bergantiños G. and Kar A. (2010) On obligation Rules for minimum cost spanning tree problems. Games and Economic Behavior 69, 224237. Bergantiños G. and LorenzoFreire S. (2008a) Optimistic weighted Shapley rules in minimum cost spanning tree problems. European Journal of Operational Research 185, 289298. Bergantiños G. and LorenzoFreire S. (2008b) A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems. Economic Theory 35, 523538. Bergantiños G. and VidalPuga J. (2007) A fair rule in minimum cost spanning tree problems. Journal of Economic Theory 137(1), 326352. Bergantiños G. and VidalPuga J. (2009) Additivity in minimum cost spanning tree problems. Journal of Mathematical Economics 45(12), 3842, doi:10.1016/j.jmateco.2008.03.003 Bogomolnaia A and Moulin H. (2010) Sharing a minimal cost spanning tree: Beyond the Folk solution. Games and Economic Behavior 69, 238248. Bird C.G. (1976) On cost allocation for a spanning tree: A game theoretic approach. Networks 6, 335350. Brânzei R., Moretti S., Norde H. and Tijs S. (2004) The Pvalue for cost sharing in minimum cost spanning tree situations. Theory and Decision 56, 4761. Granot D. and Huberman G. (1981) Minimum cost spanning tree games. Mathematical Programming 21, 118. Kruskal J. (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7, 4850. Lorenzo L. and LorenzoFreire S. (2009) A characterization of Kruskal sharing rules for minimum cost spanning tree problems. International Journal of Game Theory 38, 107126. Megiddo N. (1978) Computational complexity and the game theory approach to cost allocation for a tree. Mathematics of Operations Research 3, 189196. Norde H., Moretti S. and Tijs S. (2004) Minimum cost spanning tree games and population monotonic allocation schemes. European Journal of Operational Research 154, 8497. Tijs S., Branzei R., Moretti S. and Norde H. (2006) Obligation rules for minimum cost spanning tree situations and their monotonicity properties. European Journal of Operational Research 175, 121134. 
URI:  https://mpra.ub.unimuenchen.de/id/eprint/39994 