Bergantiños, Gustavo and VidalPuga, Juan (2016): Oneway and twoway cost allocation in hub network problems.
There is a more recent version of this item available. 

PDF
MPRA_paper_74875.pdf Download (354kB)  Preview 
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 (oneway flow) or that nodes are interested in both sending and receiving data (twoway flow). In both cases, we study the nonemptiness of the core and the Shapley value of the corresponding cost game.
Item Type:  MPRA Paper 

Original Title:  Oneway and twoway cost allocation in hub network problems 
Language:  English 
Keywords:  hub network; cost allocation; core; Shapley value 
Subjects:  C  Mathematical and Quantitative Methods > C7  Game Theory and Bargaining Theory > C71  Cooperative Games 
Item ID:  74875 
Depositing User:  Juan VidalPuga 
Date Deposited:  04 Nov 2016 08:00 
Last Modified:  27 Sep 2019 01:44 
References:  AlcaldeUnzu, J., GómezRúa, M., and Molis, E. (2015). Sharing the costs of cleaning a river: the upstream responsibility rule. Games and Economic Behavior, 90:134–150. Alumur, S. and Kara, B. Y. (2008). Network hub allocation problems: The state of the art. European Journal of Operational Research, 190:1–21. Aykin, T. (1994). Lagrangean relaxation based approaches to capacitated hubandspoke network design problem. European Journal of Operational Research, 79(3):501–523. Bailey, J. (1997). The economics of Internet interconnection agreements. In McKnight, L. and Bailey, J., editors, Internet Economics, pages 115–168. MIT Press, Cambridge, MA. Bergantiños, G. and Kar, A. (2010). On obligation rules for minimum cost spanning tree problems. Games and Economic Behavior, 69:224–237. Bogomolnaia, A. and Moulin, H. (2010). Sharing the cost of a minimal cost spanning tree: beyond the folk solution. Games and Economic Behavior, 69(2):238–248. Bryan, D. and O’Kelly, M. (1999). Hubandspoke networks in air transportation: An analytical review. Journal of Regional Science, 39(2):275–295. Dutta, B. and Mishra, D. (2012). Minimum cost arborescences. Games and Economic Behavior, 74(1):120–143. Ernst, A. and Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86:141–159. Farahani, R. Z., Hekmatfar, M., Arabani, A. B., and Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering, 64(4):10961109. Greenfield, D. (2000). Europe’s virtual conundrum. Network Magazine, 15:116–123. Guardiola, L. A., Meca, A., and Puerto, J. (2009). Productioninventory games: A new class of totally balanced combinatorial optimization games. Games and Economic Behavior, 65(1):205–219. Special Issue in Honor of Martin Shubik. Helme, M. and Magnanti, T. (1989). Designing satellite communication networks by zeroone quadratic programming. Networks, 19:427–450. Labbé, M., Yaman, H., and Gourdin, E. (2005). A branch and cut algorithm for the hub location problems with single assignment. Mathematical Programming, 102:371–405. Matsubayashi, N., Umezawa, M., Masuda, Y., and Nishino, H. (2005). A cost allocation problem arising in hubspoke network systems. European Journal of Operational Research, 160:821–838. Moulin, H. (2014). Pricing traffic in a spanning network. Games and Economic Behavior, 86:475–490. Sasaki, M. and Fukushima, M. (2003). On the hubandspoke model with arc capacity constraints. Journal of the Operations Research Society of Japan, 46(4):409–428. Sim, T., Lowe, T. J., and Thomas, B. W. (2009). The stochastichub center problem with servicelevel constraints. Computers & Operations Research, 36(12):3166–3177. New developments on hub location. SkorinKapov, D. (1998). Hub network games. Networks, 31:293–302. SkorinKapov, D. (2001). On cost allocation in hublike networks. Annals of Operations Research, 106:63–78. Trudeau, C. (2012). A new stable and more responsible cost sharing solution for mcst problems. Games and Economic Behavior, 75(1):402–412. Trudeau, C. (2014). Minimum cost spanning tree problems with indifferent agents. Games and Economic Behavior, 84:137–151. Yang, T.H. (2009). Stochastic air freight hub location and flight routes planning. Applied Mathematical Modelling, 33(12):4424–4430. 
URI:  https://mpra.ub.unimuenchen.de/id/eprint/74875 
Available Versions of this Item
 Oneway and twoway cost allocation in hub network problems. (deposited 04 Nov 2016 08:00) [Currently Displayed]