Characterization of monotonic rules in minimum cost spanning tree problems
We provide, in minimum cost spanning tree problems, a general framework to identify 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 so-called irreducible core, that results from decreasing the cost of the arcs as much as possible, without reducing the minimal cost.
KeywordsCost sharing Minimum cost spanning tree problems Monotonicity Irreducible core
- Bergantiños G, Gómez-Rúa M (2014) An axiomatic approach in minimum cost spanning tree problems with groups. Ann Oper Res. doi:10.1007/s10479-012-1251-x
- Feltkamp V, Tijs S, Muto S (1994) On the irreducible core and the equal remaining obligation rule of minimum cost extension problems. Mimeo, Tilburg University, TilburgGoogle Scholar
- Hernández P, Peris JE, Silva-Reus JA (2013) Strategic sharing of a costly network. Working paperGoogle Scholar