Equal-need sharing of a network under connectivity constraints

DOI10.1016/j.geb.2010.08.002zbMath1236.91094OpenAlexW2073865253MaRDI QIDQ536106

Hervé Moulin, Francois Laigret

Publication date: 16 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.geb.2010.08.002

zbMATH Keywords

networkconnectivitycost sharingstand alone core

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

Axiomatization of the counting rule for cost-sharing with possibly redundant items, Cost allocation in asymmetric trees, Sharing the cost of risky projects, The proportional Shapley value and applications, Routing-proofness in congestion-prone networks, Sharing the cost of redundant items, Loss allocation in energy transmission networks, A new rule for source connection problems, Unnamed Item, COST SHARING IN NETWORKS: SOME OPEN QUESTIONS, Revenue Sharing in Airline Alliance Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Sharing the cost of a network: core and core allocations
• The clustering matroid and the optimal clustering tree
• The complete optimal stars-clustering-tree problem
• A Simple Expression for the Shapley Value in a Special Case
• Cooperative facility location games
• The Nucleolus of a Characteristic Function Game