IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v106y2001i1p63-7810.1023-a1014505607701.html
   My bibliography  Save this article

On Cost Allocation in Hub-Like Networks

Author

Listed:
  • Darko Skorin-Kapov

Abstract

We consider telecommunication network design in which each pair of nodes can communicate via a direct link and the communication flow can be delivered through any path in the network. The cost of flow through each link is discounted if and only if the amount of flow exceeds a certain threshold. This exploitation of economies of scale encourages the concentration of flows and use of relatively small number of links. We will call such networks hub-like networks. The cost of services delivered through a hub-like network is distributed among its users who may be individuals or organizations with possibly conflicting interests. The cooperation of these users is essential for the exploitation of economies of scale. Consequently, there is a need to find a fair distribution of the cost of providing the service among users of such network. In order to describe this cost allocation problem we formulate the associated cooperative game, to be referred to as the hub-like game. Special attention is paid to users' contribution to economies of scale. We then demonstrate that certain cost allocation solutions (the core and the nucleolus of the hub-like game), which provide users with the incentive to cooperate, can be efficiently characterized. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • Darko Skorin-Kapov, 2001. "On Cost Allocation in Hub-Like Networks," Annals of Operations Research, Springer, vol. 106(1), pages 63-78, September.
  • Handle: RePEc:spr:annopr:v:106:y:2001:i:1:p:63-78:10.1023/a:1014505607701
    DOI: 10.1023/A:1014505607701
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1014505607701
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1014505607701?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka, 2005. "Threshold based discounting networks: The cost allocation provided by the nucleolus," European Journal of Operational Research, Elsevier, vol. 166(1), pages 154-159, October.
    2. G. Bergantiños & J. Vidal-Puga, 2020. "One-way and two-way cost allocation in hub network problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 199-234, March.
    3. Kratica, Jozef & Stanimirovic, Zorica & Tosic, Dusan & Filipovic, Vladimir, 2007. "Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 182(1), pages 15-28, October.
    4. Cruijssen, F. & Borm, P.E.M. & Dullaert, W. & Hamers, H.J.M., 2007. "Joint Hub Network Development," Discussion Paper 2007-76, Tilburg University, Center for Economic Research.
    5. Cruijssen, F., 2006. "Horizontal cooperation in transport and logistics," Other publications TiSEM ab6dbe68-aebc-4b03-8eea-d, Tilburg University, School of Economics and Management.
    6. M. Khodabakhshi & K. Aryavash, 2014. "The fair allocation of common fixed cost or revenue using DEA concept," Annals of Operations Research, Springer, vol. 214(1), pages 187-194, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:106:y:2001:i:1:p:63-78:10.1023/a:1014505607701. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.