Optimal Cost-Sharing in General Resource Selection Games

DOI10.1287/opre.2016.1512zbMath1354.91082OpenAlexW2183587304MaRDI QIDQ2957453

Vasilis Gkatzelis, Tim Roughgarden, Konstantinos Kollias

Publication date: 26 January 2017

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

Full work available at URL: https://semanticscholar.org/paper/0b307f0cdd9fb589477d30ff4e1a0f3a5ebabe20

zbMATH Keywords

Shapley valuecost sharingnetwork routingprice of anarchyresource selection

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (11)

How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium ⋮ Unnamed Item ⋮ The price of anarchy in loss systems ⋮ Cost-sharing strategy for carbon emission reduction and sales effort: a Nash game with government subsidy ⋮ Cost-sharing games with rank-based utilities ⋮ The power of one evil secret agent ⋮ Congestion games with priority-based scheduling ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems ⋮ A Characterization of Undirected Graphs Admitting Optimal Cost Shares ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems

Cites Work

• Unnamed Item
• Nonpreemptive coordination mechanisms for identical machines
• Characterizing the existence of potential functions in weighted congestion games
• Coordination mechanisms
• The price of anarchy of serial, average and incremental cost sharing
• Coordination mechanisms for selfish scheduling
• Potential games
• Congestion games with player-specific payoff functions
• Improving the price of anarchy for selfish routing via coordination mechanisms
• Efficient coordination mechanisms for unrelated machine scheduling
• The price of anarchy in an exponential multi-server
• Decentralized utilitarian mechanisms for scheduling games
• A class of games possessing pure-strategy Nash equilibria
• The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
• Preemptive Coordination Mechanisms for Unrelated Machines
• Optimal Cost-Sharing in Weighted Congestion Games
• Coordination mechanisms from (almost) all scheduling policies
• Restoring Pure Equilibria to Weighted Congestion Games
• Designing Network Protocols for Good Equilibria
• The Impact of Oligopolistic Competition in Networks
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Optimal Coordination Mechanisms for Unrelated Machine Scheduling
• Cost-Balancing Tolls for Atomic Network Congestion Games
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• A Characterization of Waiting Time Performance Realizable by Single-Server Queues
• Optimal Cost Sharing for Resource Selection Games
• Intrinsic robustness of the price of anarchy
• Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
• Distributed Welfare Games
• Worst-Case Efficiency Analysis of Queueing Disciplines
• Composable and efficient mechanisms
• The network equilibrium problem in integers
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• The Price of Routing Unsplittable Flow
• Strategyproof sharing of submodular costs: budget balance versus efficiency

This page was built for publication: Optimal Cost-Sharing in General Resource Selection Games