39 citations · 92 across the 11 of their papers we have counts for
1 paper · 1 filter
Satyen Kale, Chansoo Lee, Dávid Pál
We show that several online combinatorial optimization problems that admit efficient no-regret algorithms become computationally hard in the sleeping setting where a subset of acti…