Nikhil Devanur
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Online Optimization and Learning Under Long-Term Convex Constraints and Objectives | Optimization and Decision-Making Under Uncertainty (Simons Institute, September 2016) | 2016-09-19 |
Presents concrete algorithms that turn long-term convex constraints and concave objectives into repeated linear goals using Fenchel conjugate linearization and… | ||
| Online Advertisements and Online Algorithms | Algorithmic Game Theory and Practice 2015 | 2015-11-16 |
Shows that the balanced discount rule gives a 1-1/e competitive guarantee for online budgeted allocation via a primal‑dual LP view, then proves stochastic… | ||
| nothing matches | ||