Cost sharing on prices for games on graphs

DOI10.1007/s10878-016-0099-4zbMath1411.91144OpenAlexW2554962632MaRDI QIDQ1680478

Daniel Li Li, Erfang Shan

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0099-4

zbMATH Keywords

rankingcooperative gamecost sharinggraph gameunit price

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Component-wise proportional solutions for communication graph games
• The price of anarchy of serial, average and incremental cost sharing
• An efficient and almost budget balanced cost sharing method
• Allocation rules for hypergraph communication situations
• Average cost pricing versus serial cost sharing: An axiomatic comparison
• Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
• An efficient and fair solution for communication graph games
• Producer Incentives in Cost Allocation
• Serial Cost Sharing
• Graphs and Cooperation in Games
• Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure