Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
Minimum cost spanning tree problems connect agents efficiently to a source when agents are located at different points and the cost of using an edge is fixed. The folk and cycle-complete cost sharing solutions always offer core allocations. We provide similar characterizations for both. A new property is based on the following observation: when all agents have the same cost to connect to the source, we can connect one of them to the source then connect all other agents to him, as if he was the source. Cost sharing should also be done in these two steps. We also use some common properties: core selection, piecewise linearity and an independence property. The solutions are differentiated by properties that apply when the cheapest edge to the source gets cheaper. Either the savings are equally distributed among all agents (folk) or the agent on that edge gets all of the savings (cycle-complete). Copyright Springer-Verlag Berlin Heidelberg 2014
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 42 (2014)
Issue (Month): 4 (April)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/355|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Bergantiños, Gustavo & Vidal-Puga, Juan, 2009. "Additivity in minimum cost spanning tree problems," Journal of Mathematical Economics, Elsevier, vol. 45(1-2), pages 38-42, January.
- Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems," Discussion Paper 1994-106, Tilburg University, Center for Economic Research.
- Bergantinos, Gustavo & Vidal-Puga, Juan J., 2007.
"A fair rule in minimum cost spanning tree problems,"
Journal of Economic Theory,
Elsevier, vol. 137(1), pages 326-352, November.
- Gustavo Bergantiños & Juan Vidal-Puga, 2005. "A fair rule in minimum cost spanning tree problems," Game Theory and Information 0504001, EconWPA.
- Trudeau, Christian, 2012. "A new stable and more responsive cost sharing solution for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 75(1), pages 402-412.
- Kar, Anirban, 2002. "Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 265-277, February.
- Christian Trudeau, 2014. "Linking the Kar and folk solutions through a problem separation property," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 845-870, November.
- Christian Trudeau, 2013. "Linking the Kar and Folk Solutions Through a Problem Separation Property," Working Papers 1301, University of Windsor, Department of Economics.