A fair rule in minimum cost spanning tree problems
AbstractWe study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.
Download InfoIf 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.
Bibliographic InfoPaper provided by EconWPA in its series Game Theory and Information with number 0504001.
Length: 35 pages
Date of creation: 04 Apr 2005
Date of revision:
Note: Type of Document - pdf; pages: 35
Contact details of provider:
Web page: http://18.104.22.168
minimum cost spanning tree; cost sharing;
Other versions of this item:
- 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.
- C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
- D8 - Microeconomics - - Information, Knowledge, and Uncertainty
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (EconWPA).
If references are entirely missing, you can add them using this form.