A cost allocation rule for k-hop minimum cost spanning tree problems
G. Bergantiños Cid, M. Gómez-Rua, N. Llorca-Pascual, M. Pulido Cayuela, J. Sánchez Soriano
In this paper we consider k-hop minimum cost spanning tree problems where each node needs to be connected to the source through a path involving at most k links. We prove that the core of a k-hop minimum cost spanning tree problem could be empty. We also introduce and characterize a cost sharing rule based on bankruptcy problems which satisfies meaningful properties in this setting.
Palabras clave: k-hop minimum cost spanning tree problems, bankruptcy problems, cea
Programado
JC2 Teoría de juegos 1
19 de abril de 2012 12:00
Sala Bruselas
Otros trabajos en la misma sesión
F. Llerena, M. Núñez Oliva
A. Meca Martínez, G. Sosic
G. Bergantiños Cid, L. Lorenzo Picado, S. Lorenzo Freire, J. J. Vidal Puga
Últimas noticias
-
22/04/12
Certificados -
11/03/12
Programa del congreso -
11/03/12
Cuota reducida -
15/01/12
Cuota superreducida
