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

Gustavo Bergantiños and Juan Vidal-Puga

MPRA Paper from University Library of Munich, Germany

Abstract: 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.

Keywords: hub network; cost allocation; core; Shapley value (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Date: 2016-11-02
New Economics Papers: this item is included in nep-gth, nep-net and nep-tre
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/74875/1/MPRA_paper_74875.pdf original version (application/pdf)
https://mpra.ub.uni-muenchen.de/98242/9/MPRA_paper_98242.pdf revised version (application/pdf)

Related works:
Journal Article: One-way and two-way cost allocation in hub network problems (2020)
Working Paper: One-way and two-way cost allocation in hub network problems (2018)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:74875

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().