The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games

DOI10.1287/opre.1110.0979zbMath1241.91026OpenAlexW2117819361MaRDI QIDQ2893922

Konstantin Miller, Tobias Harks

Publication date: 26 June 2012

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1110.0979

zbMATH Keywords

resource allocation gamesnetwork routing gamesinefficiency of equilibriamarginal cost pricingcost sharing methods

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (7)

Optimal cost sharing for capacitated facility location games ⋮ How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium ⋮ Cost-sharing games with rank-based utilities ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Unnamed Item ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems

This page was built for publication: The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games