On the set of extreme core allocations for minimum cost spanning tree problems
- Christian Trudeau 1
- Juan Vidal-Puga 2
- 1 Department of Economics, University of Windsor
- 2 Research Group of Economic Analysis and Departamento de Estatistica e IO, Universidade de Vigo.
- Ginzo Villamayor, María José (ed. lit.)
- Alonso Meijide, José María (ed. lit.)
- Ramil Novo, Luis Alberto (ed. lit.)
Editorial: Sociedade Galega para a Promoción da Estatística e da Investigación de Operacións (SGAPEIO) ; Servizo de Publicacións ; Deputación de Lugo
ISBN: 978-84-8192-522-7
Ano de publicación: 2015
Páxinas: 21-32
Congreso: Congreso galego de Estatística e Investigación de Operacións (12. 2015. Lugo)
Tipo: Achega congreso
Resumo
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.