Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Aaron Berger, William Kuszmaul, Adam Polak +2

We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of $w$ workers and a multiset $T\subseteq [t]$ of $|T|=w$ tasks,…