IDEAS home Printed from https://ideas.repec.org/p/tse/wpaper/127271.html
   My bibliography  Save this paper

Sharing cost of network among users with differentiated willingness to pay

Author

Listed:
  • Panova, Elena

Abstract

We consider the problem of sharing the cost of a fixed tree-network among users with differentiated willingness to pay for the good supplied through the network. We find that the associated value-sharing problem is convex, hence, the core is large and we axiomatize a new, computationally simple core selection based on the idea of proportionality.

Suggested Citation

  • Panova, Elena, 2022. "Sharing cost of network among users with differentiated willingness to pay," TSE Working Papers 22-1356, Toulouse School of Economics (TSE), revised Mar 2023.
    • Handle: RePEc:tse:wpaper:127271
    as

    Download full text from publisher

    File URL: https://www.tse-fr.eu/sites/default/files/TSE/documents/doc/wp/2022/wp_tse_1356.pdf
    File Function: Full Text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Moulin,Hervi, 1991. "Axioms of Cooperative Decision Making," Cambridge Books, Cambridge University Press, number 9780521424585, October.
    2. Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.
    3. S. C. Littlechild & G. Owen, 1973. "A Simple Expression for the Shapley Value in a Special Case," Management Science, INFORMS, vol. 20(3), pages 370-372, November.
    4. S. H. Tijs & M. Koster & E. Molina & Y. Sprumont, 2002. "Sharing the cost of a network: core and core allocations," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(4), pages 567-599.
    5. Aadland, David & Kolpin, Van, 1998. "Shared irrigation costs: An empirical and axiomatic analysis," Mathematical Social Sciences, Elsevier, vol. 35(2), pages 203-218, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Panova, Elena, 2023. "Sharing cost of network among users with differentiated willingness to pay," Games and Economic Behavior, Elsevier, vol. 142(C), pages 666-689.
    2. Elena Panova, 2023. "Sharing cost of network among users with differentiated willingness to pay," Post-Print hal-04556220, HAL.
    3. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    4. Márkus, Judit & Pintér, Miklós & Radványi, Anna, 2011. "The Shapley value for airport and irrigation games," MPRA Paper 30031, University Library of Munich, Germany.
    5. Youngsub Chun & Boram Park, 2016. "The airport problem with capacity constraints," Review of Economic Design, Springer;Society for Economic Design, vol. 20(3), pages 237-253, September.
    6. Juarez, Ruben & Ko, Chiu Yu & Xue, Jingyi, 2018. "Sharing sequential values in a network," Journal of Economic Theory, Elsevier, vol. 177(C), pages 734-779.
    7. Paula Jaramillo, 2013. "Congestion in irrigation problems," Documentos CEDE 10553, Universidad de los Andes, Facultad de Economía, CEDE.
    8. R. Brânzei & E. Iñarra & S. Tijs & J. M. Zarzuelo, 2005. "Cooperation by Asymmetric Agents in a Joint Project," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 7(4), pages 623-640, October.
    9. Bergantiños, Gustavo & Groba, Carlos & Sartal, Antonio, 2023. "Applying the Shapley value to the tuna fishery," European Journal of Operational Research, Elsevier, vol. 309(1), pages 306-318.
    10. Baomin Dong & Debing Ni & Yuntong Wang, 2012. "Sharing a Polluted River Network," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 53(3), pages 367-387, November.
    11. M. Fiestras-Janeiro & Ignacio García-Jurado & Manuel Mosquera, 2011. "Cooperative games and cost allocation problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(1), pages 1-22, July.
    12. Sprumont, Yves, 2000. "Coherent Cost-Sharing Rules," Games and Economic Behavior, Elsevier, vol. 33(1), pages 126-144, October.
    13. Hu, Cheng-Cheng & Tsay, Min-Hung & Yeh, Chun-Hsien, 2018. "A study of the nucleolus in the nested cost-sharing problem: Axiomatic and strategic perspectives," Games and Economic Behavior, Elsevier, vol. 109(C), pages 82-98.
    14. Fatemeh Babaei & Hamidreza Navidi & Stefano Moretti, 2022. "A bankruptcy approach to solve the fixed cost allocation problem in transport systems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 332-358, July.
    15. Hougaard, Jens Leth & Tvede, Mich & Østerdal, Lars Peter, 2013. "Cost Sharing in Chains and Other Fixed Trees," Discussion Papers on Economics 12/2013, University of Southern Denmark, Department of Economics.
    16. Debing Ni & Yuntong Wang, 2013. "Additive cost sharing on a tree," Working Papers 1307, University of Windsor, Department of Economics.
    17. Yan-An Hwang & Chun-Hsien Yeh, 2012. "A characterization of the nucleolus without homogeneity in airport problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(2), pages 355-364, February.
    18. Moulin, Herve & Laigret, Francois, 2011. "Equal-need sharing of a network under connectivity constraints," Games and Economic Behavior, Elsevier, vol. 72(1), pages 314-320, May.
    19. Alcalde, Jose & Angel Silva, Jose, 2004. "A proposal for sharing costs," Journal of Mathematical Economics, Elsevier, vol. 40(7), pages 831-845, November.
    20. Kattuman, P.A. & Green, R.J. & Bialek, J.W., 2001. "A Tracing Method for Pricing Inter-Area Electricity Trades," Cambridge Working Papers in Economics 0107, Faculty of Economics, University of Cambridge.

    More about this item

    Keywords

    sharing network cost; core; proportional allocation;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:tse:wpaper:127271. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/tsetofr.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.