On the set of extreme core allocations for minimal cost spanning tree problems
Christian Trudeau () and
Journal of Economic Theory, 2017, vol. 169, issue C, 425-452
Minimal 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. We propose a method, based on the concept of marginal games, to generate all extreme points of the corresponding core. We show that three of the most famous solutions to share the cost of mcst problems, the Bird, folk and cycle-complete solutions, are closely related to our method.
Keywords: Minimal cost spanning tree problems; Extreme core allocations; Reduced game; Bird solution; Folk solution; Cycle-complete solution (search for similar items in EconPapers)
JEL-codes: C71 D63 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
Working Paper: On the set of extreme core allocations for minimal cost spanning tree problems (2015)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:169:y:2017:i:c:p:425-452
Access Statistics for this article
Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell
More articles in Journal of Economic Theory from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().