Strong Price of Anarchy for Machine Load Balancing

DOI10.1007/978-3-540-73420-8_51zbMath1171.68390OpenAlexW1573584048MaRDI QIDQ5428841

Svetlana Olonetsky, Haim Kaplan, Meital Levy, Amos Fiat

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2007/1225/

zbMATH Keywords

game theorystrong Nash equilibriaload balancingprice of anarchy

Mathematics Subject Classification ID

Noncooperative games (91A10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Partition Equilibrium Always Exists in Resource Selection Games ⋮ On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games ⋮ Strong equilibrium in cost sharing connection games ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ Selfish Vector Packing ⋮ Collusion in atomic splittable routing games ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ On the complexity of Pareto-optimal Nash and strong equilibria ⋮ Partition equilibrium always exists in resource selection games ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Pareto optimal equilibria for selfish bin packing with uniform cost sharing ⋮ The price of anarchy on uniformly related machines revisited ⋮ Scheduling games with rank-based utilities ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ Non-clairvoyant scheduling games ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Selfish Bin Packing ⋮ Selfish vector packing ⋮ Profit sharing with thresholds and non-monotone player utilities ⋮ Approximate Strong Equilibrium in Job Scheduling Games ⋮ Selfish bin packing ⋮ Inefficiency of equilibria for the machine covering game on uniform machines ⋮ Load rebalancing games in dynamic systems with migration costs ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ The Price of Stochastic Anarchy ⋮ Selfish load balancing for jobs with favorite machines ⋮ Strong price of anarchy ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games ⋮ A note on the lower bound for the price of anarchy of scheduling games on unrelated machines ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines ⋮ Parametric packing of selfish items and the subset sum algorithm

This page was built for publication: Strong Price of Anarchy for Machine Load Balancing