IDEAS home Printed from https://ideas.repec.org/p/fth/aixmeq/93a19.html
   My bibliography  Save this paper

Traffic Based Cost Allocation in Network

Author

Listed:
  • Henriet, D.
  • Moulin, H.

Abstract

To share the fixed cost of a communication network, the private-cost method allocates to each subscriber the cost of his dedicated terminal devices. The external-cost method shares the connecting cost of user i among all of his correspondents in proportion to their traffic with i. All convex combinations of these two methods are characterized by three axioms: additivity with respect to connecting costs, sustainability (it is not profitable for any subnetwork to duplicate equipment for inside traffic), and no transit (it is not profitable for any three users i, j, and k to make some of the traffic between i and j transit through k).
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Henriet, D. & Moulin, H., 1993. "Traffic Based Cost Allocation in Network," G.R.E.Q.A.M. 93a19, Universite Aix-Marseille III.
    • Handle: RePEc:fth:aixmeq:93a19
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    Citations

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


    Cited by:

    1. Ju, Biung-Ghi, 2013. "Coalitional manipulation on networks," Journal of Economic Theory, Elsevier, vol. 148(2), pages 627-662.
    2. Ruben Juarez & Michael Wu, 2019. "Routing-Proofness in Congestion-Prone Networks," Games, MDPI, vol. 10(2), pages 1-18, April.
    3. John A. Weinberg, 1997. "The organization of private payment networks," Economic Quarterly, Federal Reserve Bank of Richmond, issue Spr, pages 25-44.
    4. Dong, Baomin & Guo, Guixia & Wang, Yuntong, 2012. "Highway toll pricing," European Journal of Operational Research, Elsevier, vol. 220(3), pages 744-751.
    5. Quant, Marieke & Borm, Peter & Reijnierse, Hans, 2006. "Congestion network problems and related games," European Journal of Operational Research, Elsevier, vol. 172(3), pages 919-930, August.
    6. Christophe Labreuche & Michel Grabisch, 2008. "A value for bi-cooperative games," Post-Print halshs-00308738, HAL.
    7. Friedman, Eric & Moulin, Herve, 1999. "Three Methods to Share Joint Costs or Surplus," Journal of Economic Theory, Elsevier, vol. 87(2), pages 275-312, August.
    8. Dutta, Bhaskar & Mutuswami, Suresh, 1997. "Stable Networks," Journal of Economic Theory, Elsevier, vol. 76(2), pages 322-344, October.
      • Dutta, Bhaskar & Mutuswami, Suresh, 1996. "Stable Networks," Working Papers 971, California Institute of Technology, Division of the Humanities and Social Sciences.
    9. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2020. "Manipulability in the cost allocation of transport systems," ThE Papers 20/08, Department of Economic Theory and Economic History of the University of Granada..
    10. Mariusz Kaleta & Eugeniusz Toczyłowski, 2009. "A cost allocation framework for LP and GLP games," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 19(4), pages 27-46.
    11. Moulin, Hervé, 2014. "Pricing traffic in a spanning network," Games and Economic Behavior, Elsevier, vol. 86(C), pages 475-490.
    12. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2021. "On how to allocate the fixed cost of transport systems," Annals of Operations Research, Springer, vol. 301(1), pages 81-105, June.
    13. Sprumont, Yves, 2000. "Coherent Cost-Sharing Rules," Games and Economic Behavior, Elsevier, vol. 33(1), pages 126-144, October.
    14. Mariusz Kaleta & Eugeniusz Toczylowski, 2009. "A cost allocation framework for lp and glp games," Operations Research and Decisions, Wroclaw University of Technology, Institute of Organization and Management, vol. 4, pages 27-46.

    More about this item

    Keywords

    communication;

    Statistics

    Access and download statistics

    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:fth:aixmeq:93a19. 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: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/greqafr.html .

    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.