Nikhil R. Devanur
Affiliations: Amazon
 Microsoft Research (former)
According to our database^{1},
Nikhil R. Devanur
authored at least 96 papers
between 2002 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on dl.acm.org
On csauthors.net:
Bibliography
2022
Games Econ. Behav., 2022
2021
SIAM J. Comput., 2021
Proceedings of the Web and Internet Economics  17th International Conference, 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
2020
Games Econ. Behav., 2020
Games Econ. Behav., 2020
CoRR, 2020
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Third Conference on Machine Learning and Systems, 2020
2019
Multiscale Online Learning: Theory and Applications to Online Auctions and Pricing.
J. Mach. Learn. Res., 2019
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems.
J. ACM, 2019
Oper. Res., 2019
Games Econ. Behav., 2019
Introduction to the Special Issue  Algorithmic Game Theory  STOC/FOCS/SODA 2012.
Games Econ. Behav., 2019
Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
2018
ACM Trans. Economics and Comput., 2018
ACM Trans. Algorithms, 2018
Proc. VLDB Endow., 2018
CoRR, 2018
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018
Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, 2018
A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications.
Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, 2018
2017
SIGecom Exch., 2017
NII Shonan Meet. Rep., 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
The Optimal Mechanism for Selling to a Budget Constrained Buyer: The General Case.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
2016
ACM Trans. Economics and Comput., 2016
ACM Trans. Economics and Comput., 2016
CoRR, 2016
Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 2226, 2016, 2016
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives.
Proceedings of the 29th Conference on Learning Theory, 2016
2015
J. Econ. Theory, 2015
CoRR, 2015
CoRR, 2015
CoRR, 2015
CoRR, 2015
Proceedings of the ThirtyFirst Conference on Uncertainty in Artificial Intelligence, 2015
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
2014
CoRR, 2014
CoRR, 2014
Proceedings of the ACM Conference on Economics and Computation, 2014
Proceedings of the ACM Conference on Economics and Computation, 2014
2013
CoRR, 2013
CoRR, 2013
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, 2013
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
2012
CoRR, 2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012
2011
SIGecom Exch., 2011
New geometryinspired relaxations and algorithms for the metric Steiner tree problem.
Math. Program., 2011
Proceedings of the Internet and Network Economics  7th International Workshop, 2011
Proceedings of the Algorithms and Data Structures  12th International Symposium, 2011
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC2011), 2011
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011
2010
Rationality and Strongly Polynomial Solvability of EisenbergGale Markets with Two Agents.
SIAM J. Discret. Math., 2010
Proceedings of the Internet and Network Economics  6th International Workshop, 2010
Proceedings of the Internet and Network Economics  6th International Workshop, 2010
Proceedings of the TwentyFirst Annual ACMSIAM Symposium on Discrete Algorithms, 2010
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC2010), 2010
2009
Oper. Res. Lett., 2009
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
The adwords problem: online keyword matching with budgeted bidders under random permutations.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC2009), 2009
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC2009), 2009
Limited and online supply and the bayesian foundations of priorfree mechanism design.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC2009), 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
2008
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach.
SIAM J. Discret. Math., 2008
J. ACM, 2008
Electron. Colloquium Comput. Complex., 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
2007
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
2006
EisenbergGale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity.
Electron. Colloquium Comput. Complex., 2006
New Results on Rationality and Strongly Polynomial Time Solvability in EisenbergGale Markets.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2005
Decis. Support Syst., 2005
Proceedings of the Internet and Network Economics, First International Workshop, 2005
2004
The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004
2003
Extensions of the spending constraintmodel: existence and uniqueness of equilibria (extended abstract).
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC2003), 2003
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2003
An Improved Approximation Scheme for Computing ArrowDebreu Prices for the Linear Case.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003
2002
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002