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

• 成果类型: Article
• 署名作者: Trudeau, Christian; Vidal-Puga, Juan
• 署名单位: University of Windsor; Universidade de Vigo; Universidade de Vigo
• 刊物名称: JOURNAL OF ECONOMIC THEORY
• ISSN/ISSBN: 0022-0531
• DOI: 10.1016/j.jet.2017.03.001
• 发表日期: 2017
• 页码: 425-452
• 关键词: Minimal cost spanning tree problems; Extreme core allocations; Reduced game; Bird solution; Folk solution; Cycle-complete solution

摘要

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. (C) 2017 Elsevier Inc. All rights reserved.