Tight Bounds for Selfish and Greedy Load Balancing

DOI10.1007/11786986_28zbMath1223.68025MaRDI QIDQ3613769

Luca Moscardelli, Ioannis Caragiannis, Panagiotis Kanellopoulos, Michele Flammini, Christos Kaklamanis

Publication date: 12 March 2009

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

Full work available at URL: https://doi.org/10.1007/11786986_28

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Nonadaptive Selfish Routing with Online Demands, The Influence of Link Restrictions on (Random) Selfish Routing, Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy, Nonpreemptive coordination mechanisms for identical machines, Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game, Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness, On the performance of approximate equilibria in congestion games, Graphical congestion games, Performance of one-round walks in linear congestion games, Competitive online multicommodity routing, Inefficiency of games with social context, Scheduling to maximize participation, Nash equilibria in discrete routing games with convex latency functions, Stackelberg strategies for atomic congestion games, Congestion games with linearly independent paths: convergence time and price of anarchy, Coordination mechanisms for parallel machine scheduling, Improved lower bounds on the price of stability of undirected network design games, Efficiency of Equilibria in Uniform Matroid Congestion Games, Improved Lower Bounds on the Price of Stability of Undirected Network Design Games, Scheduling to Maximize Participation