| 2011 |
|---|
| 38 | Distributed algorithms via gradient descent for fisher markets. Benjamin E. Birnbaum, Nikhil R. Devanur, Lin Xiao. ACM Conference on Electronic Commerce 2011, 127-136. Web SearchBibTeXDownload |
| 37 | Near optimal online algorithms and fast approximation algorithms for resource allocation problems. Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens. ACM Conference on Electronic Commerce 2011, 29-38. Web SearchBibTeXDownload |
| 36 | Real-time bidding algorithms for performance-based display ad allocation. Ye Chen, Pavel Berkhin, Bo Anderson, Nikhil R. Devanur. KDD 2011, 1307-1315. Web SearchBibTeXDownload |
| 35 | New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani. Math. Program. (130): 1-32 (2011). Web SearchBibTeXDownload |
| 34 | Online algorithms with stochastic input. Nikhil R. Devanur. SIGecom Exchanges (10): 40-49 (2011). Web SearchBibTeXDownload |
| 33 | An O(n log n) Algorithm for a Load Balancing Problem on Paths. Nikhil R. Devanur, Uriel Feige. WADS 2011, 326-337. Web SearchBibTeXDownload |
| 32 | Prior-Independent Multi-parameter Mechanism Design. Nikhil R. Devanur, Jason D. Hartline, Anna R. Karlin, C. Thach Nguyen. WINE 2011, 122-133. Web SearchBibTeXDownload |
| 2010 |
|---|
| 31 | Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads. Denis Charles, Max Chickering, Nikhil R. Devanur, Kamal Jain, Manan Sanghi. ACM Conference on Electronic Commerce 2010, 121-128. Web SearchBibTeXDownload |
| 30 | Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani. SIAM J. Discrete Math. (24): 1117-1136 (2010). Web SearchBibTeXDownload |
| 29 | Monotonicity in Bargaining Networks. Yossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani. SODA 2010, 817-826. Web SearchBibTeXDownload |
| 28 | Market Equilibrium with Transaction Costs. Sourav Chakraborty, Nikhil R. Devanur, Chinmay Karande. WINE 2010, 496-504. Web SearchBibTeXDownload |
| 27 | Local Dynamics in Bargaining Networks via Random-Turn Games. L. Elisa Celis, Nikhil R. Devanur, Yuval Peres. WINE 2010, 133-144. Web SearchBibTeXDownload |
| 2009 |
|---|
| 26 | The price of truthfulness for pay-per-click auctions. Nikhil R. Devanur, Sham M. Kakade. ACM Conference on Electronic Commerce 2009, 99-106. Web SearchBibTeXDownload |
| 25 | Limited and online supply and the bayesian foundations of prior-free mechanism design. Nikhil R. Devanur, Jason D. Hartline. ACM Conference on Electronic Commerce 2009, 41-50. Web SearchBibTeXDownload |
| 24 | Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres. FOCS 2009, 293-302. Web SearchBibTeXDownload |
| 23 | On competitiveness in uniform utility allocation markets. Deeparnab Chakrabarty, Nikhil R. Devanur. Oper. Res. Lett. (37): 155-158 (2009). Web SearchBibTeXDownload |
| 22 | A computational theory of awareness and decision making. Nikhil R. Devanur, Lance Fortnow. TARK 2009, 99-107. Web SearchBibTeXDownload |
| 21 | An Online Multi-unit Auction with Improved Competitive Ratio. Sourav Chakraborty, Nikhil R. Devanur. WINE 2009, 79-88. Web SearchBibTeXDownload |
| 2008 |
|---|
| 20 | A Computational Theory of Awareness and Decision Making. Nikhil R. Devanur, Lance Fortnow. Electronic Colloquium on Computational Complexity (ECCC) (15) (2008). Web SearchBibTeXDownload |
| 19 | Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents. Nikhil R. Devanur, Ravi Kannan. FOCS 2008, 45-53. Web SearchBibTeXDownload |
| 18 | New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani. IPCO 2008, 344-358. Web SearchBibTeXDownload |
| 17 | Market equilibrium via a primal--dual algorithm for a convex program. Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani. J. ACM (55) (2008). Web SearchBibTeXDownload |
| 16 | On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach. Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur. SIAM J. Discrete Math. (22): 1297-1324 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 15 | On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach. Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur. CoRR (abs/math/0703927) (2007). Web SearchBibTeXDownload |
| 14 | Computing Market Equilibrium: Beyond Weak Gross Substitutes. Chinmay Karande, Nikhil R. Devanur. WINE 2007, 368-373. Web SearchBibTeXDownload |
| 13 | On Competitiveness in Uniform Utility Allocation Markets. Deeparnab Chakrabarty, Nikhil R. Devanur. WINE 2007, 374-380. Web SearchBibTeXDownload |
| 2006 |
|---|
| 12 | Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Web SearchBibTeXDownload |
| 11 | Integrality gaps for sparsest cut and minimum linear arrangement problems. Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi. STOC 2006, 537-546. Web SearchBibTeXDownload |
| 10 | New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani. WINE 2006, 239-250. Web SearchBibTeXDownload |
| 2005 |
|---|
| 9 | Strategyproof cost-sharing mechanisms for set cover and facility location games. Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani. Decision Support Systems (39): 11-22 (2005). Web SearchBibTeXDownload |
| 8 | Price of Anarchy, Locality Gap, and a Network Service Provider Game. Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay V. Vazirani. WINE 2005, 1046-1055. Web SearchBibTeXDownload |
| 2004 |
|---|
| 7 | On the Complexity of Hilbert's 17th Problem. Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi. FSTTCS 2004, 237-249. Web SearchBibTeXDownload |
| 6 | The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results. Nikhil R. Devanur. STOC 2004, 519-528. Web SearchBibTeXDownload |
| 2003 |
|---|
| 5 | Extensions of the spending constraint-model: existence and uniqueness of equilibria (extended abstract). Nikhil R. Devanur, Vijay V. Vazirani. ACM Conference on Electronic Commerce 2003, 202-203. Web SearchBibTeXDownload |
| 4 | Strategyproof cost-sharing mechanisms for set cover and facility location games. Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani. ACM Conference on Electronic Commerce 2003, 108-114. Web SearchBibTeXDownload |
| 3 | An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. Nikhil R. Devanur, Vijay V. Vazirani. FSTTCS 2003, 149-155. Web SearchBibTeXDownload |
| 2 | Who's The Weakest Link?. Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi. SAGA 2003, 108-116. Web SearchBibTeXDownload |
| 2002 |
|---|
| 1 | Market Equilibrium via a Primal-Dual-Type Algorithm. Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani. FOCS 2002, 389-395. Web SearchBibTeXDownload |
