Abstract
In this paper, we consider spanning tree situations, where players want to be connected to a source as cheap as possible. These situations involve the construction of a spanning tree with the minimum cost as well as the allocation of the cost of this minimum cost spanning tree among its users in a fair way. Feltkamp, Muto and Tijs 1994 introduced the equal remaining obligations rule to solve the cost allocation problem in these situations. Recently, it has been shown that the equal remaining obligations rule satisfies many appealing properties and can be obtained with different approaches. In this paper, we provide a new approach to obtain the equal remaining obligations rule. Specifically, we show that the equal remaining obligations rule can be obtained as the average of the cost allocations provided by a vertex oriented construct-and-charge procedure for each order of players.
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, Vidal-Puga JJ (2005a) Several approaches to the same rule in cost spanning tree problems. Mimeo
Bergantiños G, Vidal-Puga JJ (2005b) Additivity in cost spanning tree problems. RGEA WP 10-05, University of Vigo, Spain
Bergantiños G, Vidal-Puga JJ (2007a) The optimistic TU game in minimum cost spanning tree problems. Int J Game Theory 36:223–239
Bergantiños G, Vidal-Puga JJ (2007b) A fair rule in minimum cost spanning tree problems. J Econ Theory 137:326–352
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, Muto S, Tijs S (1994) On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. CentER-DP 106, Tilburg University, Center for Economic Research, The Netherlands
Gondran M, Minoux M (1984) Graphs and algorithms. Wiley, New York
Granot D, Huberman G (1981) Minimum cost spanning tree games. Math Program 21:1–18
Granot D, Huberman G (1984) On the core and nucleolus of the minimum cost spanning tree games. Math Program 29:323–347
Kar A (2002) Axiomatization of the Shapley value on minimum cost spanning tree games. Games Econ Behav 38:265–277
Kruskal JB Jr (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7:48–50
Moretti S, Branzei R, Norde H, Tijs S (2005) Cost monotonic construct and charge rules for connection situations. CentER-DP 104, Tilburg University, Center for Economic Research, The Netherlands
Norde H, Moretti S, Tijs S (2004) Minimum cost spanning tree games and population monotonic allocation schemes. Eur J Oper Res 154:84–97
Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389–1401
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
Additional information
We thank Rodica Branzei, Stefano Moretti and two anonymous referees for helpful and inspiring comments.
Rights and permissions
About this article
Cite this article
Çiftçi, B., Tijs, S. A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations. TOP 17, 440–453 (2009). https://doi.org/10.1007/s11750-009-0113-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-009-0113-4