Nikhil R. Devanur

5.1k total citations · 1 hit paper
78 papers, 2.3k citations indexed

About

Nikhil R. Devanur is a scholar working on Management Science and Operations Research, Computer Networks and Communications and Marketing. According to data from OpenAlex, Nikhil R. Devanur has authored 78 papers receiving a total of 2.3k indexed citations (citations by other indexed papers that have themselves been cited), including 59 papers in Management Science and Operations Research, 40 papers in Computer Networks and Communications and 21 papers in Marketing. Recurrent topics in Nikhil R. Devanur's work include Auction Theory and Applications (44 papers), Optimization and Search Problems (36 papers) and Consumer Market Behavior and Pricing (21 papers). Nikhil R. Devanur is often cited by papers focused on Auction Theory and Applications (44 papers), Optimization and Search Problems (36 papers) and Consumer Market Behavior and Pricing (21 papers). Nikhil R. Devanur collaborates with scholars based in United States, United Kingdom and India. Nikhil R. Devanur's co-authors include Kamal Jain, Thomas P. Hayes, Vijay V. Vazirani, Amar Phanishayee, Phillip B. Gibbons, Gregory R. Ganger, Deepak Narayanan, Matei Zaharia, Aaron Harlap and Vivek Seshadri and has published in prestigious journals such as Operations Research, Journal of the ACM and Journal of Economic Theory.

In The Last Decade

Nikhil R. Devanur

76 papers receiving 2.2k citations

Hit Papers

PipeDream 2019 2026 2021 2023 2019 100 200 300 400
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. PipeDream
    2019 428 citations Nikhil R. Devanur et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Nikhil R. Devanur United States 24 1.2k 1.1k 483 388 371 78 2.3k
Berthold Vöcking Germany 26 1.4k 1.2× 1.4k 1.3× 532 1.1× 226 0.6× 627 1.7× 91 3.1k
Bruno Codenotti Italy 16 906 0.8× 780 0.7× 526 1.1× 159 0.4× 420 1.1× 71 2.4k
Bernhard von Stengel United Kingdom 17 1.4k 1.2× 627 0.6× 592 1.2× 156 0.4× 701 1.9× 44 2.4k
Liad Blumrosen Israel 12 1.0k 0.9× 564 0.5× 277 0.6× 291 0.8× 398 1.1× 24 1.8k
Constantinos Daskalakis United States 25 1.3k 1.1× 370 0.3× 604 1.3× 376 1.0× 628 1.7× 99 2.2k
Ηλίας Κουτσουπιάς United States 22 956 0.8× 972 0.9× 219 0.5× 97 0.3× 414 1.1× 71 1.9k
Chaitanya Swamy Canada 24 539 0.5× 656 0.6× 300 0.6× 133 0.3× 213 0.6× 57 1.6k
Michael Schapira Israel 31 556 0.5× 2.1k 1.9× 858 1.8× 175 0.5× 229 0.6× 116 2.8k
Kamesh Munagala United States 27 499 0.4× 1.7k 1.6× 531 1.1× 111 0.3× 100 0.3× 98 2.6k
Aranyak Mehta United States 18 1.1k 0.9× 1.0k 1.0× 227 0.5× 318 0.8× 283 0.8× 50 1.8k

Countries citing papers authored by Nikhil R. Devanur

Since Specialization
Citations

This map shows the geographic impact of Nikhil R. Devanur's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nikhil R. Devanur with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nikhil R. Devanur more than expected).

Fields of papers citing papers by Nikhil R. Devanur

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nikhil R. Devanur. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nikhil R. Devanur. The network helps show where Nikhil R. Devanur may publish in the future.

Co-authorship network of co-authors of Nikhil R. Devanur

This figure shows the co-authorship network connecting the top 25 collaborators of Nikhil R. Devanur. A scholar is included among the top collaborators of Nikhil R. Devanur based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Nikhil R. Devanur. Nikhil R. Devanur is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chawla, Shuchi, Nikhil R. Devanur, & Thodoris Lykouris. (2023). Static Pricing for Multi-unit Prophet Inequalities. Operations Research. 72(4). 1388–1399. 6 indexed citations
2.
Chawla, Shuchi, Nikhil R. Devanur, Anna R. Karlin, & Balasubramanian Sivan. (2022). Simple pricing schemes for consumers with evolving values. Games and Economic Behavior. 134. 344–360.
3.
Bubeck, Sébastien, Nikhil R. Devanur, Zhiyi Huang, & Rad Niazadeh. (2019). Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing. Journal of Machine Learning Research. 20(62). 1–37. 6 indexed citations
4.
Agrawal, Shipra & Nikhil R. Devanur. (2019). Bandits with Global Convex Constraints and Objective. Operations Research. 67(5). 1486–1502. 16 indexed citations
5.
Devanur, Nikhil R. & Zhiyi Huang. (2017). Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms. ACM Transactions on Algorithms. 14(1). 1–30. 9 indexed citations
6.
Chawla, Shuchi, et al.. (2016). Simple pricing schemes for consumers with evolving values. Symposium on Discrete Algorithms. 1476–1490. 6 indexed citations
7.
Agrawal, Shipra & Nikhil R. Devanur. (2016). Linear Contextual Bandits with Knapsacks. Neural Information Processing Systems. 29. 3450–3458. 18 indexed citations
8.
Agrawal, Shipra, Nikhil R. Devanur, & Lihong Li. (2016). An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives. Conference on Learning Theory. 4–18. 12 indexed citations
9.
Charles, Denis, Nikhil R. Devanur, & Balasubramanian Sivan. (2016). Multi-Score Position Auctions. 417–425. 4 indexed citations
10.
Devanur, Nikhil R., Yuval Peres, & Balasubramanian Sivan. (2015). Perfect bayesian equilibria in repeated sales. Symposium on Discrete Algorithms. 983–1002. 11 indexed citations
11.
Devanur, Nikhil R., Jamie Morgenstern, Vasilis Syrgkanis, & S. Matthew Weinberg. (2015). Simple Auctions with Simple Strategies. 305–322. 7 indexed citations
12.
Devanur, Nikhil R. & Zhiyi Huang. (2014). Primal dual gives almost optimal energy efficient online algorithms. Symposium on Discrete Algorithms. 1123–1140. 20 indexed citations
13.
Chen, Yiling, Nikhil R. Devanur, David M. Pennock, & Jennifer Wortman Vaughan. (2014). Removing arbitrage from wagering mechanisms. 377–394. 10 indexed citations
14.
Devanur, Nikhil R., Kamal Jain, & Robert Kleinberg. (2013). Randomized primal-dual analysis of RANKING for online bipartite matching. Symposium on Discrete Algorithms. 101–107. 49 indexed citations
15.
Devanur, Nikhil R., Kamal Jain, & Robert Kleinberg. (2013). Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching. 101–107. 45 indexed citations
16.
Devanur, Nikhil R., Zhiyi Huang, Nitish Korula, Vahab Mirrokni, & Qiqi Yan. (2013). Whole-page optimization and submodular welfare maximization with online bidders. 305–322. 4 indexed citations
17.
Azar, Yossi, et al.. (2013). Cloud scheduling with setup cost. 298–304. 14 indexed citations
18.
Charles, Denis, et al.. (2010). Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads. 121–128. 19 indexed citations
19.
Devanur, Nikhil R., Christos H. Papadimitriou, Amin Saberi, & Vijay V. Vazirani. (2008). Market equilibrium via a primal--dual algorithm for a convex program. Journal of the ACM. 55(5). 1–18. 111 indexed citations
20.
Devanur, Nikhil R., Milena Mihail, & Vijay V. Vazirani. (2004). Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems. 39(1). 11–22. 28 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Berthold Vöcking Breakdown of academic impact, for papers by Bruno Codenotti Breakdown of academic impact, for papers by Bernhard von Stengel Breakdown of academic impact, for papers by Liad Blumrosen Breakdown of academic impact, for papers by Constantinos Daskalakis Breakdown of academic impact, for papers by Ηλίας Κουτσουπιάς Breakdown of academic impact, for papers by Chaitanya Swamy Breakdown of academic impact, for papers by Michael Schapira Breakdown of academic impact, for papers by Kamesh Munagala Breakdown of academic impact, for papers by Aranyak Mehta
Rankless by CCL
2026