One-way and two-way cost allocation in hub network problems

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

E. Gutiérrez Núñez, N. Llorca Pascual, M. A. Mosquera Rodríguez, J. Sánchez-Soriano

J. Sánchez-Soriano, V. Fragnelli, N. Llorca Pascual

G. Bergantiños Cid, P. Arribillaga

M. Pulido Cayuela, J. Sánchez-Soriano, G. Bergantiños Cid, M. Gómez-Rúa, N. Llorca Pascual