Sharing the cost of redundant items

DOI10.1016/J.GEB.2014.05.010zbMath1302.91117OpenAlexW2061050166MaRDI QIDQ485785

Jens Leth Hougaard, Hervé Moulin

Publication date: 14 January 2015

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: http://okonomi.foi.dk/workingpapers/MSAPpdf/MSAP2012/MSAP_WP06_2012.pdf

zbMATH Keywords

connectivitycost sharingconnection networksredundant costs

Mathematics Subject Classification ID

Public goods (91B18) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

Axiomatization of the counting rule for cost-sharing with possibly redundant items ⋮ Cooperative and non-cooperative Nash solution for linear supply function equilibrium game ⋮ Sharing the cost of risky projects ⋮ Minimum coloring problems with weakly perfect graphs ⋮ A conceptual model for FRAND royalty setting ⋮ Axiomatizing the public good index via merging and new arrival properties ⋮ Cost Sharing in Production Economies ⋮ Stability and fairness in the job scheduling problem

Cites Work

• Equal-need sharing of a network under connectivity constraints
• Consistency and its converse: an introduction
• COST SHARING IN NETWORKS: SOME OPEN QUESTIONS
• The Shapley Value as Aircraft Landing Fees–Revisited
• Computing Network Reliability
• Introduction to the Theory of Cooperative Games
• Unnamed Item
• Unnamed Item

This page was built for publication: Sharing the cost of redundant items