On the set of extreme core allocations for minimal cost spanning tree problems

Christian Trudeau and Juan Vidal-Puga

No 1505, Working Papers from University of Windsor, Department of Economics

Abstract: 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)
Pages: 32 pages
Date: 2015-11
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://web2.uwindsor.ca/economics/RePEc/wis/pdf/1505.pdf First version, 2015 (application/pdf)

Related works:
Journal Article: On the set of extreme core allocations for minimal cost spanning tree problems (2017)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wis:wpaper:1505

Access Statistics for this paper

More papers in Working Papers from University of Windsor, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Christian Trudeau ().