Abstract
In this article, we define a new family of rules in minimum cost spanning tree problems related with Kruskal’s algorithm. We characterize this family with a cost monotonicity property and a cost additivity property.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bergantiños G, Kar A (2007) Monotonicity properties and the irreducible core in minimum cost spanning tree problems. University of Vigo, Mimeo
Bergantiños G, Lorenzo-Freire S (2008a) Optimistic weighted Shapley rules in minimum cost spanning tree problems. Eur J Oper Res 185: 289–298
Bergantiños G, Lorenzo-Freire S (2008b) A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems. J Econ Theory 35(3): 523–538
Bergantiños G, Vidal-Puga JJ (2007) A fair rule in minimum cost spanning tree problems. J Econ Theory 137: 326–352
Bergantiños G, Vidal-Puga JJ (2009) Additivity in minimum cost spanning tree problems. J Math Econ 45: 38–42
Bird CG (1976) On cost allocation for a spanning tree: a game theoretic approach. Networks 6: 335–350
Branzei R, Moretti S, Norde H, Tijs S (2004) The P-value for cost sharing in minimum cost spanning tree situations. Theory Decis 56: 47–61
Dutta B, Kar A (2004) Cost monotonicity, consistency and minimum cost spanning tree games. Games Econ Behav 48: 223–248
Feltkamp V, Tijs S, Muto S (1994) On the irreducible core and the equal remaining obligation rule of minimum cost extension problems. Tilburg University, Mimeo
Kar A (2002) Axiomatization of the Shapley value on minimum cost spanning tree games. Games Econ Behav 38: 265–277
Kruskal J (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7: 48–50
Lorenzo L, Lorenzo-Freire S (2009) A characterization of kruskal sharing rules for minimum cost spanning tree problems. Int J Game Theory 38: 107–126
Norde H, Moretti S, Tijs S (2004) Minimum cost spanning tree games and population monotonic allocation schemes. Eur J Oper Res 154: 84–97
Tijs S, Branzei R, Moretti S, Norde H (2006) Obligation rules for minimum cost spanning tree situations and their monotonicity properties. Eur J Oper Res 175: 121–134
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bergantiños, G., Lorenzo, L. & Lorenzo-Freire, S. The family of cost monotonic and cost additive rules in minimum cost spanning tree problems. Soc Choice Welf 34, 695–710 (2010). https://doi.org/10.1007/s00355-009-0426-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00355-009-0426-0