The competition game on hub network design
AbstractIn a competitive market, carriers in network industries design their hub networks and operations plans to maximize their respective profits. The long-term Cournot-Nash equilibrium steady state requires that none of the carriers may unilaterally alternate their hub networks or operations plans to increase profits. We study an integral-constrained game theoretic model for time-definite less-than-truckload freight services in an oligopolistic market. The research showed that carriers favor geographic central than outlying hub locations. With price-elastic demand in the freight market, the higher the network density is, the higher the profit is. Thus, the stable Cournot-Nash equilibrium solution states that all carriers respectively possess a similarly dense hub network, which is robust even with uneven changes in carrier cost structures. However, there is a prorogation effect in that an operating cost reduction will increase the individual carrier's and also the competitors' profits. The results also showed that there are cooperative equilibria that can make all carriers better off, but are unstable solutions in the non-cooperative game.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part B: Methodological.
Volume (Year): 44 (2010)
Issue (Month): 4 (May)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lin, Cheng-Chang, 2001. "The freight routing problem of time-definite freight delivery common carriers," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 525-547, July.
- Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2009. "The design of single allocation incomplete hub networks," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 936-951, December.
- Rodriguez-Martin, Inmaculada & Salazar-Gonzalez, Juan Jose, 2008. "Solving a capacitated hub location problem," European Journal of Operational Research, Elsevier, vol. 184(2), pages 468-479, January.
- Ebery, Jamie & Krishnamoorthy, Mohan & Ernst, Andreas & Boland, Natashia, 2000. "The capacitated multiple allocation hub location problem: Formulations and algorithms," European Journal of Operational Research, Elsevier, vol. 120(3), pages 614-631, February.
- Morton E. O'Kelly & Deborah Bryan, 2002. "Interfacility Interaction in Models of Hub and Spoke Networks," Journal of Regional Science, Wiley Blackwell, vol. 42(1), pages 145-164.
- Lin, Cheng-Chang & Lin, Dung-Ying & Young, Melanie M., 2009. "Price planning for time-definite less-than-truckload freight services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(4), pages 525-537, July.
- Lin, Cheng-Chang & Chen, Sheu-Hua, 2004. "The hierarchical network design problem for time-definite express common carriers," Transportation Research Part B: Methodological, Elsevier, vol. 38(3), pages 271-283, March.
- Groothedde, Bas & Ruijgrok, Cees & Tavasszy, Lóri, 2005. "Towards collaborative, intermodal hub networks: A case study in the fast moving consumer goods market," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(6), pages 567-583, November.
- O'Kelly, M. E. & Bryan, D. L., 1998. "Hub location with flow economies of scale," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 605-616, November.
- Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
- Nero, Giovanni, 1999. "A note on the competitive advantage of large hub-and-spoke networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 35(4), pages 225-239, December.
- Ebery, Jamie, 2001. "Solving large single allocation p-hub problems with two or three hubs," European Journal of Operational Research, Elsevier, vol. 128(2), pages 447-458, January.
- Moon-gil Yoon & Young-ho Baek & Dong-wan Tcha, 1998. "Design of a distributed fiber transport network with hubbing topology," European Journal of Operational Research, Elsevier, vol. 104(3), pages 510-520, February.
- Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.