Achieving optimal backlog in multi-processor cup games
From MaRDI portal
Publication:5212854
DOI10.1145/3313276.3316342zbMath1433.68065arXiv1904.02861OpenAlexW2964054046MaRDI QIDQ5212854
Martín Farach-Colton, William Kuszmaul, Michael A. Bender
Publication date: 30 January 2020
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.02861
Analysis of algorithms (68W40) Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)
Related Items
Perpetual maintenance of machines with different urgency requirements, The matroid cup game, Cutting bamboo down to size