Load rebalancing games in dynamic systems with migration costs

DOI10.1016/j.tcs.2016.01.030zbMath1336.90035OpenAlexW2275928668MaRDI QIDQ5964072

Sofia Belikovetsky, Tami Tamir

Publication date: 26 February 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.030

zbMATH Keywords

algorithmsNash equilibriumdynamic systemsload balancing games

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items

Coordination mechanisms for scheduling games with machine modification, Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems

Cites Work

• Worst-case equilibria
• Tight bounds for selfish and greedy load balancing
• The curse of simultaneity
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Conflicting Congestion Effects in Resource Allocation Games
• Algorithms, games, and the internet
• Strong Price of Anarchy for Machine Load Balancing
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item