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
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher 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 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
Find related papers by JEL classification: C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
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.: