Strong Price of Anarchy for Machine Load Balancing
From MaRDI portal
Publication:5428841
DOI10.1007/978-3-540-73420-8_51zbMath1171.68390MaRDI 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/
91A10: Noncooperative games
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Balancing Load via Small Coalitions in Selfish Ring Routing Games, Approximate Strong Equilibrium in Job Scheduling Games, The Price of Anarchy on Uniformly Related Machines Revisited, The Price of Stochastic Anarchy, Load rebalancing games in dynamic systems with migration costs, Parametric packing of selfish items and the subset sum algorithm, 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, The price of anarchy on uniformly related machines revisited, Profit sharing with thresholds and non-monotone player utilities, Selfish bin packing, Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy, Non-clairvoyant scheduling games, Inefficiency of equilibria for the machine covering game on uniform machines, Coordination mechanisms for scheduling selfish jobs with favorite machines, Strong equilibrium in cost sharing connection games, The strong price of anarchy of linear bottleneck congestion games, Strong price of anarchy, Selfish load balancing for jobs with favorite machines, Quality of strong equilibria for selfish bin packing with uniform cost sharing, 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, Strong equilibria in games with the lexicographical improvement property, Collusion in atomic splittable routing games, Scheduling selfish jobs on multidimensional parallel machines, Pareto optimal equilibria for selfish bin packing with uniform cost sharing, Approximate strong equilibria in job scheduling games with two uniformly related machines, Partition Equilibrium Always Exists in Resource Selection Games, On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games, Selfish Vector Packing, Selfish Bin Packing
