Travelled to:5 × USA
Collaborated with:K.Jain ∅ Y.K.Cheung R.Cole Y.Chen P.Berkhin B.Anderson S.Khot R.Saket N.K.Vishnoi
Talks about:algorithm (2) equilibrium (1) constraint (1) substitut (1) sparsest (1) gradient (1) problem (1) perform (1) minimum (1) display (1)
Person: Nikhil R. Devanur
DBLP: Devanur:Nikhil_R=
Contributed to:
20132012
201120062004Wrote 5 papers:
- STOC-2013-CheungCD
- Tatonnement beyond gross substitutes?: gradient descent to the rescue (YKC, RC, NRD), pp. 191–200.
- STOC-2012-DevanurJ #online
- Online matching with concave returns (NRD, KJ), pp. 137–144.
- KDD-2011-ChenBAD #algorithm #realtime
- Real-time bidding algorithms for performance-based display ad allocation (YC, PB, BA, NRD), pp. 1307–1315.
- STOC-2006-DevanurKSV #linear #problem
- Integrality gaps for sparsest cut and minimum linear arrangement problems (NRD, SK, RS, NKV), pp. 537–546.
- STOC-2004-Devanur #algorithm #constraints #equilibrium
- The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results (NRD), pp. 519–528.