Load balancing without regret in the bulletin board model
From MaRDI portal
Publication:5170301
DOI10.1145/1582716.1582731zbMath1291.68050OpenAlexW1977471818MaRDI QIDQ5170301
Éva Tardos, Georgios Piliouras, Robert D. Kleinberg
Publication date: 23 July 2014
Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1582716.1582731
Learning and adaptive systems in artificial intelligence (68T05) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (4)
Tight bounds for parallel randomized load balancing ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ Distributed algorithms for QoS load balancing ⋮ Load balancing without regret in the bulletin board model
This page was built for publication: Load balancing without regret in the bulletin board model
