Munich Personal RePEc Archive

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

Bergantiños, Gustavo and Vidal-Puga, Juan (2016): One-way and two-way cost allocation in hub network problems.

This is the latest version of this item.

[thumbnail of MPRA_paper_98242.pdf]

Download (408kB) | Preview


We study hub problems where a set of nodes send and receive data from each other. In order to reduce costs, the nodes use a network with a given set of hubs. We address the cost sharing aspect by assuming that nodes are only interested in either 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 both cases, we study the non-emptiness of the core and the Shapley value of the corresponding cost game.

Available Versions of this Item

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.