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

Christian Trudeau ^[1] ; Juan Vidal-Puga ^[2]
1. [1] Department of Economics, University of Windsor
2. [2] Research Group of Economic Analysis and Departamento de Estatistica e IO, Universidade de Vigo.
Localización: XII Congreso Galego de Estatística e Investigación de Operacións: Lugo, 22-23-24 de outubro de 2015. Actas / María José Ginzo Villamayor (ed. lit.), José María Alonso Meijide (ed. lit.) , Luis Alberto Ramil Novo (ed. lit.), 2015, ISBN 978-84-8192-522-7, págs. 21-32
Idioma: inglés
Enlaces
- Texto Completo Libro
Resumen
- Minimum 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.