Bergantiños, Gustavo and Lorenzo, Leticia (2019): Cost additive rules in minimum cost spanning tree problems with multiple sources.

PDF
MPRA_paper_96937.pdf Download (258kB)  Preview 
Abstract
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple sources called Kruskal sharing rules. This family is characterized with cone wise additivity and independence of irrelevant trees . We also investigate some subsets of this family and provide their axiomatic characterizations. The first subset is obtained by adding core selection. The second one is obtained by adding core selection and equal treatment of source costs
Item Type:  MPRA Paper 

Original Title:  Cost additive rules in minimum cost spanning tree problems with multiple sources 
English Title:  Cost additive rules in minimum cost spanning tree problems with multiple sources 
Language:  English 
Keywords:  minimum cost spanning tree problems, multiple sources, Kruskal sharing rules, axiomatic characterizations. 
Subjects:  C  Mathematical and Quantitative Methods > C7  Game Theory and Bargaining Theory > C71  Cooperative Games 
Item ID:  96937 
Depositing User:  Gustavo Bergantiño 
Date Deposited:  14 Nov 2019 16:50 
Last Modified:  14 Nov 2019 16:50 
References:  G. Bergantiños, Y. Chun, E. Lee, L. Lorenzo (2018), The folk rule for minimum cost spanning tree problems with multiple sources, Working paper. G. Bergantiños, M. GómezRúa, N. Llorca, M. Pulido, J. SánchezSoriano (2014), A new rule for source connection problems. European Journal of Operational Research, 234(3)780788. G. Bergantiños, A. Kar, (2010) On obligation rules for minimum cost spanning tree problems, Games and Economic Behavior 69:224237. G. Bergantiños, L. Lorenzo, S. LorenzoFreire, (2010) The family of cost monotonic and cost additive rules in minimum cost spanning tree problems Social Choice and Welfare 34:695710. G. Bergantiños, L. Lorenzo, S. LorenzoFreire, (2011) A generalization of obligation rules for minimum cost spanning tree problems, European Journal of Operational Research 211:122129. G. Bergantiños, A. NavarroRamos, (2018), The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources, Working paper. G. Bergantiños, J. J. VidalPuga (2009), Additivity in minimum cost spanning tree problems, Journal of Mathematical Economics 45:3842. G. Bergantiños, J. J. VidalPuga (2007), A fair rule in minimum cost spanning tree problems, Journal of Economic Theory 137:326352. C.G. Bird, (1976) On cost allocation for a spanning tree: A game theoretic approach, Networks 6:335350 A. Bogomolnaia, H. Moulin (2010), Sharing a minimal cost spanning tree: Beyond the Folk solution, Games and Economic Behavior 69:238248. Branzei, 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. B. Dutta, A. Kar (2004), Cost monotonicity, consistency and minimum cost spanning tree games, Games and Economic Behavior 48:223248. Farley, A. M., Fragopoulou, P., Krumme, D. W., Proskurowski, A., and Richards, D. (2000). Multisource spanning tree problems. Journal of Interconnection Networks, 1, 6171. Gouveia, L., Leitner, M., and Ljubic, I. (2014). Hop constrained Steiner trees with multiple root nodes. European Journal of Operational Research, 236, 100112. Granot, D., and Granot, F. (1992). Computational Complexity of a cost allocation approach to a fixed cost forest problem. Mathematics of Operations Research, 17(4), 765780. A. Kar (2002), Axiomatization of the Shapley value on minimum cost spanning tree problems, Games and Behavior 38:265277. J. B. Kruskal (1956), On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society 7:4850. J. Kuipers (1997), Minimum cost forest games. International Journal of Game Theory, 26(3):367377. L. Lorenzo, S. LorenzoFreire (2009), A characterization of obligation rules for minimum cost spanning tree problems, International Journal of Game Theory 38:107126. H. Norde, S. Moretti, S. Tijs (2004), Minimum cost spanning tree games and population monotonic allocation schemes, European Journal of Operational Research 154:8497. R. C. Prim (1957), Shortest connection networks and some generalizations, Bell Systems Technology Journal 36:13891401. E. C. Rosenthal (1987), The minimum cost spanning forest game. Economic Letters, 23(4):355357. S. Tijs, R. Branzei, S. Moretti, H. Norde (2006), Obligation rules for minimum cost spanning tree situations and their monotonicity properties, European Journal of Operational Research 175:121134. C. Trudeau (2012), A new stable and more responsive cost sharing solution for minimum cost spanning tree problems, Games and Behavior 75:402412.. 
URI:  https://mpra.ub.unimuenchen.de/id/eprint/96937 