Advanced Search
MyIDEAS: Login

On Some Properties of Cost Allocation Rules in Minimum Cost Spanning Tree Problems

Contents:

Author Info

Abstract

We consider four cost allocation rules in minimum cost spanning tree problems. These rules were introduced by Bird (1976), Dutta and Kar (2004), Kar (2002), and Feltkamp, Tijs and Muto (1994), respectively. We give a list of desirable properties and we study which properties are satisfied by these rules.

Download Info

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.
File URL: http://auco.fsv.cuni.cz/storage/49_2008_03_251.pdf
Download Restriction: no

Bibliographic Info

Article provided by Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies in its journal AUCO Czech Economic Review.

Volume (Year): 2 (2008)
Issue (Month): 3 (December)
Pages: 251-267

as in new window
Handle: RePEc:fau:aucocz:au2008_251

Contact details of provider:
Postal: Opletalova 26, CZ-110 00 Prague
Phone: +420 2 222112330
Fax: +420 2 22112304
Email:
Web page: http://ies.fsv.cuni.cz/
More information through EDIRC

Order Information:
Email:
Web: http://auco.cuni.cz/

Related research

Keywords: Minimum cost spanning tree; properties;

Find related papers by JEL classification:

References

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.:
as in new window
  1. Gustavo Bergantiños & Juan Vidal-Puga, 2005. "A fair rule in minimum cost spanning tree problems," Game Theory and Information 0504001, EconWPA.
  2. Dutta, Bhaskar & Kar, Anirban, 2002. "Cost Monotonicity, Consistency And Minimum Cost Spanning Tree Games," The Warwick Economics Research Paper Series (TWERPS) 629, University of Warwick, Department of Economics.
  3. Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004. "The P-value for cost sharing in minimum," Theory and Decision, Springer, vol. 56(1), pages 47-61, 04.
  4. Brânzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2004. "The P-value for cost sharing in minimum cost spanning tree situations," Open Access publications from Tilburg University urn:nbn:nl:ui:12-142598, Tilburg University.
  5. Gustavo Bergantiños & Juan Vidal-Puga, 2007. "The optimistic TU game in minimum cost spanning tree problems," International Journal of Game Theory, Springer, vol. 36(2), pages 223-239, October.
  6. 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.
  7. 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.
  8. Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Additivity in cost spanning tree problems," Game Theory and Information 0405001, EconWPA.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. 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.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:fau:aucocz:au2008_251. 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: (Lenka Stastna).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.