nikhil r. devanur
nikhil r. devanur
Microsoft Research
Nessuna email verificata
Citata da
Citata da
Market equilibrium via a primal--dual algorithm for a convex program
NR Devanur, CH Papadimitriou, A Saberi, VV Vazirani
Journal of the ACM (JACM) 55 (5), 22, 2008
The adwords problem: online keyword matching with budgeted bidders under random permutations
NR Devanur, TP Hayes
Proceedings of the 10th ACM conference on Electronic commerce, 71-78, 2009
Projector: Agile reconfigurable data center interconnect
M Ghobadi, R Mahajan, A Phanishayee, N Devanur, J Kulkarni, ...
Proceedings of the 2016 ACM SIGCOMM Conference, 216-229, 2016
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
NR Devanur, K Jain, B Sivan, CA Wilkens
Journal of the ACM (JACM) 66 (1), 1-41, 2019
Real-time bidding algorithms for performance-based display ad allocation
Y Chen, P Berkhin, B Anderson, NR Devanur
Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011
Strategyproof cost-sharing mechanisms for set cover and facility location games
NR Devanur, M Mihail, VV Vazirani
Decision Support Systems 39 (1), 11-22, 2005
Randomized primal-dual analysis of ranking for online bipartite matching
NR Devanur, K Jain, RD Kleinberg
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
The price of truthfulness for pay-per-click auctions
NR Devanur, SM Kakade
Proceedings of the 10th ACM conference on Electronic commerce, 99-106, 2009
Integrality gaps for sparsest cut and minimum linear arrangement problems
NR Devanur, SA Khot, R Saket, NK Vishnoi
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
Bandits with global convex constraints and objective
S Agrawal, NR Devanur
Operations Research 67 (5), 1486-1502, 2019
Fast algorithms for online stochastic convex programming
S Agrawal, NR Devanur
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
A duality-based unified approach to bayesian mechanism design
Y Cai, NR Devanur, SM Weinberg
SIAM Journal on Computing, STOC16-160-STOC16-200, 2019
Online matching with concave returns
NR Devanur, K Jain
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
Distributed algorithms via gradient descent for fisher markets
B Birnbaum, NR Devanur, L Xiao
Proceedings of the 12th ACM conference on Electronic commerce, 127-136, 2011
The sample complexity of auctions with side information
NR Devanur, Z Huang, CA Psomas
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Convex program duality, Fisher markets, and Nash social welfare
R Cole, N Devanur, V Gkatzelis, K Jain, T Mai, VV Vazirani, S Yazdanbod
Proceedings of the 2017 ACM Conference on Economics and Computation, 459-460, 2017
Market equilibria in polynomial time for fixed number of goods or agents
NR Devanur, R Kannan
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 45-53, 2008
The spending constraint model for market equilibrium: Algorithmic, existence and uniqueness results
NR Devanur
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
Primal dual gives almost optimal energy-efficient online algorithms
NR Devanur, Z Huang
ACM Transactions on Algorithms (TALG) 14 (1), 1-30, 2017
An improved approximation scheme for computing Arrow-Debreu prices for the linear case
NR Devanur, VV Vazirani
International Conference on Foundations of Software Technology and …, 2003
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20