Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5100108 | Journal of Economic Theory | 2017 | 28 Pages |
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
Related Topics
Social Sciences and Humanities
Economics, Econometrics and Finance
Economics and Econometrics
Authors
Christian Trudeau, Juan Vidal-Puga,