G. Bergantiños Cid, J. J. Vidal Puga
We study hub problems where a set on nodes send and receive data from each other. In order to reduce costs, the nodes use a network with an optimal set of hubs. We address the cost sharing aspect by assuming either that nodes are only interested in sending or receiving data, but not both (one-way flow) or that nodes are interested in both sending and receiving data (two-way flow). In either case, we study the non-emptiness of the core as well as the Shapley value of the corresponding cost game.
Palabras clave: hub network,cost allocation,core,Shapley value
Programado
X03.4 Grupo de Teoría de Juegos II
7 de septiembre de 2016 10:00
Aula 21.07
