On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems
Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces an algorithm generating all elements of the irreducible core. Moreover, the equal remaining obligations rule, a one-point refinement of the irreducible core ispresented. Finally, the paper characterizes these solutions axiomatically. The classical Bird tree allocation of minimum cost spanning tree problems is obtained as a particular case in our algorithm for the irreducible core.
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.:
- Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "Minimum cost spanning extension problems : The proportional rule and the decentralized rule," Discussion Paper 1994-96, Tilburg University, Center for Economic Research.
- Kuipers, Jeroen, 1993. "On the Core of Information Graph Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(4), pages 339-350.
When requesting a correction, please mention this item's handle: RePEc:tiu:tiucen:56ea8c64-a05f-4b3f-ab61-9096e213f109. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman)
If references are entirely missing, you can add them using this form.