21 citations · 21 across the 2 of their papers we have counts for
2 papers
cs.LG2017★ 21 cited
Efficient Regret Minimization in Non-Convex Games
Elad Hazan, Karan Singh, Cyril Zhang
We consider regret minimization in repeated games with non-convex loss functions. Minimizing the standard notion of regret is computationally intractable. Thus, we define a natural…
cs.LG2017
Dynamic Task Allocation for Crowdsourcing Settings
Angela Zhou, Irineo Cabreros, Karan Singh
We consider the problem of optimal budget allocation for crowdsourcing problems, allocating users to tasks to maximize our final confidence in the crowdsourced answers. Such an opt…