IDEAS home Printed from https://ideas.repec.org/p/foi/msapwp/06_2012.html
   My bibliography  Save this paper

Sharing the Cost of Redundant Items

Author

Listed:
  • Jens Leth Hougaard

    (Institute of Food and Resource Economics, University of Copenhagen)

  • Hervé Moulin

    (Department of Economics, Rice University)

Abstract

We ask how to share the cost of finitely many public goods (items) among users with different needs: some smaller subsets of items are enough to serve the needs of each user, yet the cost of all items must be covered, even if this entails inefficiently paying for redundant items. Typical examples are network connectivity problems when an existing (possibly inefficient) network must be maintained. We axiomatize a family of simple usage indices, one for each agent and for each item, measuring the relative worth of this item across agents, and generating cost sharing rules additive in costs.

Suggested Citation

  • Jens Leth Hougaard & Hervé Moulin, 2012. "Sharing the Cost of Redundant Items," MSAP Working Paper Series 06_2012, University of Copenhagen, Department of Food and Resource Economics.
    • Handle: RePEc:foi:msapwp:06_2012
    as

    Download full text from publisher

    File URL: http://okonomi.foi.dk/workingpapers/MSAPpdf/MSAP2012/MSAP_WP06_2012.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Moulin, Herve, 2002. "Axiomatic cost and surplus sharing," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 6, pages 289-357, Elsevier.
    2. William Thomson, 2011. "Consistency and its converse: an introduction," Review of Economic Design, Springer;Society for Economic Design, vol. 15(4), pages 257-291, December.
    3. Michael O. Ball, 1979. "Computing Network Reliability," Operations Research, INFORMS, vol. 27(4), pages 823-838, August.
    4. BALL, Michael O., 1979. "Computing network reliability," LIDAM Reprints CORE 377, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Hervé Moulin, 2013. "Cost Sharing In Networks: Some Open Questions," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(02), pages 1-10.
    6. S.C. Littlechild & G.F. Thompson, 1977. "Aircraft Landing Fees: A Game Theory Approach," Bell Journal of Economics, The RAND Corporation, vol. 8(1), pages 186-204, Spring.
    7. William Thomson, 2007. "Cost allocation and airport problems," RCER Working Papers 537, University of Rochester - Center for Economic Research (RCER).
    8. Pradeep Dubey, 1982. "The Shapley Value as Aircraft Landing Fees--Revisited," Management Science, INFORMS, vol. 28(8), pages 869-874, August.
    9. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Jens Leth Hougaard & Mich Tvede, 2020. "Implementation of Optimal Connection Networks," IFRO Working Paper 2020/06, University of Copenhagen, Department of Food and Resource Economics.
    2. Eric Bahel & Christian Trudeau, 2022. "Minimum coloring problems with weakly perfect graphs," Review of Economic Design, Springer;Society for Economic Design, vol. 26(2), pages 211-231, June.
    3. Jens Leth Hougaard & Mich Tvede, 2020. "Trouble Comes in Threes: Core stability in Minimum Cost Connection Networks," IFRO Working Paper 2020/07, University of Copenhagen, Department of Food and Resource Economics.
    4. Gustavo Berganti~nos & Juan D. Moreno-Ternero, 2023. "Revenue sharing at music streaming platforms," Papers 2310.11861, arXiv.org.
    5. Gildas Sédry Fopa & Issofa Moyouwou & Joseph Siani, 2022. "Axiomatization of the counting rule for cost-sharing with possibly redundant items," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 58(3), pages 567-587, April.
    6. Debing Ni & Yuntong Wang, 2013. "Additive cost sharing on a tree," Working Papers 1307, University of Windsor, Department of Economics.
    7. Hougaard, Jens Leth & Ko, Chiu Yu & Zhang, Xuyao, 2023. "A conceptual model for FRAND royalty setting," Mathematical Social Sciences, Elsevier, vol. 123(C), pages 167-176.
    8. Bahel, Eric & Trudeau, Christian, 2019. "Stability and fairness in the job scheduling problem," Games and Economic Behavior, Elsevier, vol. 117(C), pages 1-14.
    9. Eric Bahel & Christian Trudeau, 2021. "Minimum coloring problem: the core and beyond," Working Papers 2005, University of Windsor, Department of Economics.
    10. Yuntong Wang, 2013. "An Axiomatic Approach to the Airline Emission Fees Problem," Working Papers 1308, University of Windsor, Department of Economics.
    11. Léa Munich, 2023. "Schedule Situations and their Cooperative Game Theoretic Representations," Working Papers 2023-08, CRESE.

    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. Jens Leth Hougaard & Hervé Moulin, 2018. "Sharing the cost of risky projects," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 65(3), pages 663-679, May.
    2. Gildas Sédry Fopa & Issofa Moyouwou & Joseph Siani, 2022. "Axiomatization of the counting rule for cost-sharing with possibly redundant items," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 58(3), pages 567-587, April.
    3. 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.
    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. Cano Berlanga, Sebastian & Giménez Gómez, José M. (José Manuel) & Vilella Bach, Misericòrdia, 2015. "Enjoying cooperative games: The R package GameTheory," Working Papers 2072/247653, Universitat Rovira i Virgili, Department of Economics.
    6. Sanchez-Soriano, Joaquin, 2021. "Families of sequential priority rules and random arrival rules with withdrawal limits," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 136-148.
    7. Bigatti, A.M. & Pascual-Ortigosa, P. & Sáenz-de-Cabezón, E., 2021. "A C++ class for multi-state algebraic reliability computations," Reliability Engineering and System Safety, Elsevier, vol. 213(C).
    8. Paula Jaramillo, 2013. "Congestion in irrigation problems," Documentos CEDE 10553, Universidad de los Andes, Facultad de Economía, CEDE.
    9. Vásquez-Brage, M. & van den Nouweland, C.G.A.M. & García-Jurado, I., 1995. "Owen's coalitional value and aircraft landing fees," Discussion Paper 1995-104, Tilburg University, Center for Economic Research.
    10. Jane, Chin-Chia & Laih, Yih-Wenn, 2010. "A dynamic bounding algorithm for approximating multi-state two-terminal reliability," European Journal of Operational Research, Elsevier, vol. 205(3), pages 625-637, September.
    11. Siwei Chen, 2015. "Systematic favorability in claims problems with indivisibilities," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(2), pages 283-300, February.
    12. Yuntong Wang, 2013. "An Axiomatic Approach to the Airline Emission Fees Problem," Working Papers 1308, University of Windsor, Department of Economics.
    13. Jun, Tackseung & Kim, Jeong-Yoo, 2007. "Connectivity, stability and efficiency in a network as an information flow," Mathematical Social Sciences, Elsevier, vol. 53(3), pages 314-331, May.
    14. Ragavendran Gopalakrishnan & Jason R. Marden & Adam Wierman, 2014. "Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1252-1296, November.
    15. 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.
    16. Cancela, Héctor & Petingi, Louis, 2007. "Properties of a generalized source-to-all-terminal network reliability model with diameter constraints," Omega, Elsevier, vol. 35(6), pages 659-670, December.
    17. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    18. Grahame F. Thompson, 2020. "Deal or no deal? Some reflections on the ‘Baker-Thompson rule,’ ‘matching,’ and ‘market design’," Journal of Cultural Economy, Taylor & Francis Journals, vol. 13(5), pages 652-662, September.
    19. Potters, Jos & Sudholter, Peter, 1999. "Airport problems and consistent allocation rules," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 83-102, July.
    20. Stefano Moretti & Fioravante Patrone, 2008. "Transversality of the Shapley value," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(1), pages 1-41, July.

    More about this item

    Keywords

    Cost sharing; Redundant costs; Connection networks; Connectivity;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D30 - Microeconomics - - Distribution - - - General
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation
    • M41 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Accounting - - - Accounting

    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:foi:msapwp:06_2012. 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: Geir Tveit (email available below). General contact details of provider: https://edirc.repec.org/data/msakudk.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.