Efficiency analysis of load balancing games with and without activation costs

DOI10.1007/s10951-011-0247-8zbMath1280.91095OpenAlexW2059107044MaRDI QIDQ2434275

Sinan Gürel, Bo Chen

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/11511/47753

zbMATH Keywords

load balancingcost sharingprice of anarchyprice of stabilityresource allocation gamecongestion cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Other game-theoretic models (91A40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (15)

Cost-sharing scheduling games on restricted unrelated machines ⋮ Efficiency analysis with respect to the unit cost objectives in scheduling games ⋮ Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis ⋮ Coordination mechanisms for scheduling games with machine modification ⋮ Inefficiency of equilibria for scheduling game with machine activation costs ⋮ Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost ⋮ Inefficiency analysis of the scheduling game on limited identical machines with activation costs ⋮ Resource Allocation Games with Multiple Resource Classes ⋮ Strong stability of Nash equilibria in load balancing games ⋮ Convergence of best-response dynamics in games with conflicting congestion effects ⋮ Improved price of anarchy for machine scheduling games with coordination mechanisms ⋮ Tighter price of anarchy for selfish task allocation on selfish machines ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ Scheduling games on uniform machines with activation cost ⋮ Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong equilibrium in cost sharing connection games
• Utilitarian resource assignment
• A new model for selfish routing
• Nash equilibria in discrete routing games with convex latency functions
• Selfish routing with incomplete information
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Conflicting Congestion Effects in Resource Allocation Games
• Intrinsic robustness of the price of anarchy
• Algorithms, games, and the internet
• Exact Price of Anarchy for Polynomial Congestion Games
• Tradeoffs and Average-Case Equilibria in Selfish Routing
• The Price of Routing Unsplittable Flow
• Sharing the cost of multicast transmissions

This page was built for publication: Efficiency analysis of load balancing games with and without activation costs