default search action
Nikhil R. Devanur
Person information
- affiliation: Amazon
- affiliation (former): Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j25]Shuchi Chawla
, Nikhil R. Devanur
Static Pricing for Multi-unit Prophet Inequalities. Oper. Res. 72(4): 1388-1399 (2024) - 2022
- [j24]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
Simple pricing schemes for consumers with evolving values. Games Econ. Behav. 134: 344-360 (2022) - 2021
- [j23]Yang Cai
A Duality-Based Unified Approach to Bayesian Mechanism Design. SIAM J. Comput. 50(3) (2021) - [c71]Simina Brânzei, Nikhil R. Devanur, Yuval Rabani:
Proportional Dynamics in Exchange Economies. EC 2021: 180-201 - [c70]Xintong Wang, David M. Pennock, Nikhil R. Devanur, David M. Rothschild, Biaoshuai Tao, Michael P. Wellman
Designing a Combinatorial Financial Options Market. EC 2021: 864-883 - [c69]Shuchi Chawla, Nikhil R. Devanur, Thodoris Lykouris:
Static Pricing for Multi-unit Prophet Inequalities (Extended Abstract). WINE 2021: 545-546 - [i42]Xintong Wang, David M. Pennock, Nikhil R. Devanur, David M. Rothschild, Biaoshuai Tao, Michael P. Wellman:
Designing a Combinatorial Financial Options Market. CoRR abs/2109.06443 (2021) - 2020
- [j22]Nikhil R. Devanur, Nima Haghpanah
Optimal multi-unit mechanisms with private demands. Games Econ. Behav. 121: 482-505 (2020) - [j21]Yun Kuen Cheung
Tatonnement beyond gross substitutes? Gradient descent to the rescue. Games Econ. Behav. 123: 295-326 (2020) - [c68]Guanhua Wang, Shivaram Venkataraman, Amar Phanishayee, Jorgen Thelin, Nikhil R. Devanur, Ion Stoica:
Blink: Fast and Generic Collectives for Distributed ML. MLSys 2020 - [c67]Jakub Tarnawski, Amar Phanishayee, Nikhil R. Devanur, Divya Mahajan, Fanny Nina Paravecino:
Efficient Algorithms for Device Placement of DNN Graph Operators. NeurIPS 2020 - [c66]Nikhil R. Devanur, Kira Goldner
Optimal Mechanism Design for Single-Minded Agents. EC 2020: 193-256 - [c65]Rachel Cummings, Nikhil R. Devanur, Zhiyi Huang, Xiangning Wang:
Algorithmic Price Discrimination. SODA 2020: 2432-2451 - [i41]Nikhil R. Devanur, Kira Goldner, Raghuvansh Saxena, Ariel Schvartzman, S. Matthew Weinberg:
Optimal Mechanism Design for Single-Minded Agents. CoRR abs/2002.06329 (2020) - [i40]Jakub Tarnawski, Amar Phanishayee, Nikhil R. Devanur, Divya Mahajan, Fanny Nina Paravecino:
Efficient Algorithms for Device Placement of DNN Graph Operators. CoRR abs/2006.16423 (2020) - [i39]Shuchi Chawla, Nikhil R. Devanur, Thodoris Lykouris:
Static pricing for multi-unit prophet inequalities. CoRR abs/2007.07990 (2020)
2010 – 2019
- 2019
- [j20]Nikhil R. Devanur, Jason D. Hartline, Tim Roughgarden:
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2012. Games Econ. Behav. 113: 1-3 (2019) - [j19]Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan
Perfect Bayesian Equilibria in repeated sales. Games Econ. Behav. 118: 570-588 (2019) - [j18]Shipra Agrawal
Bandits with Global Convex Constraints and Objective. Oper. Res. 67(5): 1486-1502 (2019) - [j17]Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems. J. ACM 66(1): 7:1-7:41 (2019) - [j16]Sébastien Bubeck, Nikhil R. Devanur, Zhiyi Huang, Rad Niazadeh:
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing. J. Mach. Learn. Res. 20: 62:1-62:37 (2019) - [c64]Yang Cai
Simple and Approximately Optimal Pricing for Proportional Complementarities. EC 2019: 239-240 - [c63]Deepak Narayanan, Aaron Harlap, Amar Phanishayee, Vivek Seshadri, Nikhil R. Devanur, Gregory R. Ganger, Phillip B. Gibbons, Matei Zaharia
PipeDream: generalized pipeline parallelism for DNN training. SOSP 2019: 1-15 - [i38]Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens:
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems. CoRR abs/1903.03944 (2019) - [i37]Simina Brânzei, Nikhil R. Devanur, Yuval Rabani:
Proportional Dynamics in Exchange Economies. CoRR abs/1907.05037 (2019) - [i36]Yang Cai, Nikhil R. Devanur, Kira Goldner, R. Preston McAfee:
Simple and Approximately Optimal Pricing for Proportional Complementarities. CoRR abs/1909.00788 (2019) - [i35]Guanhua Wang, Shivaram Venkataraman, Amar Phanishayee, Jorgen Thelin, Nikhil R. Devanur, Ion Stoica:
Blink: Fast and Generic Collectives for Distributed ML. CoRR abs/1910.04940 (2019) - [i34]Rachel Cummings, Nikhil R. Devanur, Zhiyi Huang, Xiangning Wang:
Algorithmic Price Discrimination. CoRR abs/1912.05770 (2019) - 2018
- [j15]Zhicheng Yin, Jin Sun, Ming Li, Jaliya Ekanayake, Haibo Lin, Marc T. Friedman, José A. Blakeley, Clemens A. Szyperski
Bubble Execution: Resource-aware Reliable Analytics at Cloud Scale. Proc. VLDB Endow. 11(7): 746-758 (2018) - [j14]Nikhil R. Devanur, Zhiyi Huang
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms. ACM Trans. Algorithms 14(1): 5:1-5:30 (2018) - [j13]Constantinos Daskalakis, Nikhil R. Devanur, S. Matthew Weinberg
Revenue Maximization and Ex-Post Budget Constraints. ACM Trans. Economics and Comput. 6(3-4): 20:1-20:19 (2018) - [c62]Nikhil R. Devanur, Balasubramanian Sivan, Vasilis Syrgkanis:
Truthful Multi-Parameter Auctions with Online Supply: an Impossible Combination. SODA 2018: 753-769 - [c61]Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications. SODA 2018: 2311-2325 - [c60]Nikhil R. Devanur, Janardhan Kulkarni:
A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems. SPAA 2018: 283-290 - [i33]Aaron Harlap, Deepak Narayanan, Amar Phanishayee, Vivek Seshadri, Nikhil R. Devanur, Gregory R. Ganger, Phillip B. Gibbons:
PipeDream: Fast and Efficient Pipeline Parallel DNN Training. CoRR abs/1806.03377 (2018) - [i32]Yang Cai, Nikhil R. Devanur, S. Matthew Weinberg:
A Duality-Based Unified Approach to Bayesian Mechanism Design. CoRR abs/1812.01577 (2018) - 2017
- [j12]Nikhil R. Devanur:
A report on the workshop on the economics of cloud computing. SIGecom Exch. 15(2): 25-29 (2017) - [c59]Nikhil R. Devanur, S. Matthew Weinberg
The Optimal Mechanism for Selling to a Budget Constrained Buyer: The General Case. EC 2017: 39-40 - [c58]Nikhil R. Devanur, Nima Haghpanah, Christos-Alexandros Psomas:
Optimal Multi-Unit Mechanisms with Private Demands. EC 2017: 41-42 - [c57]Shuchi Chawla, Nikhil R. Devanur, Janardhan Kulkarni, Rad Niazadeh
Truth and Regret in Online Scheduling. EC 2017: 423-440 - [c56]Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod:
Convex Program Duality, Fisher Markets, and Nash Social Welfare. EC 2017: 459-460 - [c55]Sébastien Bubeck, Nikhil R. Devanur, Zhiyi Huang
Online Auctions and Multi-scale Online Learning. EC 2017: 497-514 - [c54]Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan:
Stability of service under time-of-use pricing. STOC 2017: 184-197 - [e2]Nikhil R. Devanur, Pinyan Lu:
Web and Internet Economics - 13th International Conference, WINE 2017, Bangalore, India, December 17-20, 2017, Proceedings. Lecture Notes in Computer Science 10660, Springer 2017, ISBN 978-3-319-71923-8 [contents] - [i31]Shuchi Chawla, Nikhil R. Devanur, Janardhan Kulkarni, Rad Niazadeh:
Truth and Regret in Online Scheduling. CoRR abs/1703.00484 (2017) - [i30]Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan:
Stability of Service under Time-of-Use Pricing. CoRR abs/1704.02364 (2017) - [i29]Nikhil R. Devanur, Nima Haghpanah, Christos-Alexandros Psomas:
Optimal Multi-Unit Mechanisms with Private Demands. CoRR abs/1704.05027 (2017) - [i28]Sébastien Bubeck, Nikhil R. Devanur, Zhiyi Huang, Rad Niazadeh:
Online Auctions and Multi-scale Online Learning. CoRR abs/1705.09700 (2017) - [i27]Niv Buchbinder, Nikhil R. Devanur, Debmalya Panigrahi:
Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [j11]Yang Cai
A duality-based unified approach to Bayesian mechanism design. SIGecom Exch. 15(1): 71-77 (2016) - [j10]Nikhil R. Devanur, Zhiyi Huang
Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders. ACM Trans. Economics and Comput. 4(3): 14:1-14:20 (2016) - [j9]Nikhil R. Devanur, Jugal Garg, László A. Végh:
A Rational Convex Program for Linear Arrow-Debreu Markets. ACM Trans. Economics and Comput. 5(1): 6:1-6:13 (2016) - [c53]Shipra Agrawal, Nikhil R. Devanur, Lihong Li:
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives. COLT 2016: 4-18 - [c52]Shipra Agrawal, Nikhil R. Devanur:
Linear Contextual Bandits with Knapsacks. NIPS 2016: 3450-3458 - [c51]Monia Ghobadi, Ratul Mahajan, Amar Phanishayee, Nikhil R. Devanur, Janardhan Kulkarni, Gireeja Ranade, Pierre-Alexandre Blanche, Houman Rastegarfar, Madeleine Glick, Daniel C. Kilper
ProjecToR: Agile Reconfigurable Data Center Interconnect. SIGCOMM 2016: 216-229 - [c50]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
Simple Pricing Schemes For Consumers With Evolving Values. SODA 2016: 1476-1490 - [c49]Nikhil R. Devanur, Zhiyi Huang
The sample complexity of auctions with side information. STOC 2016: 426-439 - [c48]Yang Cai
A duality based unified approach to Bayesian mechanism design. STOC 2016: 926-939 - [c47]Denis Xavier Charles, Nikhil R. Devanur, Balasubramanian Sivan:
Multi-Score Position Auctions. WSDM 2016: 417-425 - [i26]Nikhil R. Devanur, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod:
New Convex Programs for Fisher's Market Model and its Generalizations. CoRR abs/1603.01257 (2016) - [i25]Constantinos Daskalakis, Nikhil R. Devanur, S. Matthew Weinberg:
Revenue Maximization and Ex-Post Budget Constraints. CoRR abs/1605.02054 (2016) - [i24]Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod:
Convex Program Duality, Fisher Markets, and Nash Social Welfare. CoRR abs/1609.06654 (2016) - 2015
- [j8]Nikhil R. Devanur, Jason D. Hartline, Qiqi Yan:
Envy freedom and prior-free mechanism design. J. Econ. Theory 156: 103-143 (2015) - [c46]Nikhil R. Devanur, Jamie Morgenstern, Vasilis Syrgkanis, S. Matthew Weinberg
Simple Auctions with Simple Strategies. EC 2015: 305-322 - [c45]Constantinos Daskalakis, Nikhil R. Devanur, S. Matthew Weinberg
Revenue Maximization and Ex-Post Budget Constraints. EC 2015: 433-447 - [c44]Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan:
Perfect Bayesian Equilibria in Repeated Sales. SODA 2015: 983-1002 - [c43]Shipra Agrawal, Nikhil R. Devanur:
Fast Algorithms for Online Stochastic Convex Programming. SODA 2015: 1405-1424 - [c42]Yossi Azar
Speed Scaling in the Non-clairvoyant Model. SPAA 2015: 133-142 - [c41]Nikhil R. Devanur, Miroslav Dudík, Zhiyi Huang, David M. Pennock:
Budget Constraints in Prediction Markets. UAI 2015: 238-247 - [i23]Shipra Agrawal, Nikhil R. Devanur, Lihong Li:
Contextual Bandits with Global Constraints and Objective. CoRR abs/1506.03374 (2015) - [i22]Shipra Agrawal, Nikhil R. Devanur:
Linear Contextual Bandits with Global Constraints and Objective. CoRR abs/1507.06738 (2015) - [i21]Nikhil R. Devanur, Miroslav Dudík, Zhiyi Huang, David M. Pennock:
Budget Constraints in Prediction Markets. CoRR abs/1510.02045 (2015) - [i20]Nikhil R. Devanur, Zhiyi Huang, Christos-Alexandros Psomas:
The Sample Complexity of Auctions with Side Information. CoRR abs/1511.02296 (2015) - [i19]Nikhil R. Devanur, Balasubramanian Sivan, Vasilis Syrgkanis:
Multi-parameter Auctions with Online Supply. CoRR abs/1511.03699 (2015) - [i18]Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
A Market for Scheduling, with Applications to Cloud Computing. CoRR abs/1511.08748 (2015) - 2014
- [c40]Yiling Chen, Nikhil R. Devanur, David M. Pennock, Jennifer Wortman Vaughan:
Removing arbitrage from wagering mechanisms. EC 2014: 377-394 - [c39]Shipra Agrawal, Nikhil R. Devanur:
Bandits with concave rewards and convex knapsacks. EC 2014: 989-1006 - [c38]Nikhil R. Devanur, Zhiyi Huang:
Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms. SODA 2014: 1123-1140 - [e1]Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. LIPIcs 28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-74-3 [contents] - [i17]Shipra Agrawal, Nikhil R. Devanur:
Bandits with concave rewards and convex knapsacks. CoRR abs/1402.5758 (2014) - [i16]Nikhil R. Devanur, Konstantin Makarychev, Debmalya Panigrahi, Grigory Yaroslavtsev:
Online Algorithms for Machine Minimization. CoRR abs/1403.0486 (2014) - [i15]Nikhil R. Devanur, Yuval Peres, Balasubramanian Sivan:
Perfect Bayesian Equilibria in Repeated Sales. CoRR abs/1409.3062 (2014) - [i14]Shipra Agrawal, Nikhil R. Devanur:
Fast Algorithms for Online Stochastic Convex Programming. CoRR abs/1410.7596 (2014) - [i13]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
How to sell an app: pay-per-play or buy-it-now? CoRR abs/1411.1381 (2014) - 2013
- [c37]Denis Xavier Charles, Deeparnab Chakrabarty, Max Chickering, Nikhil R. Devanur, Lei Wang:
Budget smoothing for internet ad auctions: a game theoretic approach. EC 2013: 163-180 - [c36]Nikhil R. Devanur, Bach Q. Ha, Jason D. Hartline:
Prior-free auctions for budgeted agents. EC 2013: 287-304 - [c35]Nikhil R. Devanur, Zhiyi Huang
Whole-page optimization and submodular welfare maximization with online bidders. EC 2013: 305-322 - [c34]Nikhil R. Devanur, Kamal Jain, Robert D. Kleinberg:
Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching. SODA 2013: 101-107 - [c33]Yossi Azar, Naama Ben-Aroya, Nikhil R. Devanur, Navendu Jain:
Cloud scheduling with setup cost. SPAA 2013: 298-304 - [c32]Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur:
Tatonnement beyond gross substitutes?: gradient descent to the rescue. STOC 2013: 191-200 - [i12]Nikhil R. Devanur, Shaddin Dughmi, Roy Schwartz, Ankit Sharma, Mohit Singh:
On the Approximation of Submodular Functions. CoRR abs/1304.4948 (2013) - [i11]Nikhil R. Devanur, Jugal Garg, László A. Végh:
A Rational Convex Program for Linear Arrow-Debreu Markets. CoRR abs/1307.8037 (2013) - [i10]Nikhil R. Devanur, Jamie Morgenstern, Vasilis Syrgkanis:
Draft Auctions. CoRR abs/1311.2820 (2013) - 2012
- [c31]Nikhil R. Devanur, Balasubramanian Sivan, Yossi Azar:
Asymptotically optimal algorithm for stochastic adwords. EC 2012: 388-404 - [c30]Nikhil R. Devanur, Kamal Jain:
Online matching with concave returns. STOC 2012: 137-144 - [i9]Zhiyi Huang, Nikhil R. Devanur, David L. Malec:
Sequential Auctions of Identical Items with Budget-Constrained Bidders. CoRR abs/1209.1698 (2012) - [i8]Nikhil R. Devanur, Jason D. Hartline, Qiqi Yan:
Envy Freedom and Prior-free Mechanism Design. CoRR abs/1212.3741 (2012) - [i7]Nikhil R. Devanur, Bach Q. Ha, Jason D. Hartline:
Prior-free Auctions for Budgeted Agents. CoRR abs/1212.5766 (2012) - 2011
- [j7]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. Math. Program. 130(1): 1-32 (2011) - [j6]Nikhil R. Devanur:
Online algorithms with stochastic input. SIGecom Exch. 10(2): 40-49 (2011) - [c29]Ye Chen, Pavel Berkhin, Bo Anderson, Nikhil R. Devanur:
Real-time bidding algorithms for performance-based display ad allocation. KDD 2011: 1307-1315 - [c28]Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens:
Near optimal online algorithms and fast approximation algorithms for resource allocation problems. EC 2011: 29-38 - [c27]Benjamin E. Birnbaum, Nikhil R. Devanur, Lin Xiao:
Distributed algorithms via gradient descent for fisher markets. EC 2011: 127-136 - [c26]Nikhil R. Devanur, Uriel Feige:
An O(n log n) Algorithm for a Load Balancing Problem on Paths. WADS 2011: 326-337 - [c25]Nikhil R. Devanur, Jason D. Hartline, Anna R. Karlin, C. Thach Nguyen:
Prior-Independent Multi-parameter Mechanism Design. WINE 2011: 122-133 - 2010
- [j5]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents. SIAM J. Discret. Math. 24(3): 1117-1136 (2010) - [c24]Denis Xavier Charles, Max Chickering, Nikhil R. Devanur, Kamal Jain, Manan Sanghi:
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads. EC 2010: 121-128 - [c23]Yossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani
Monotonicity in Bargaining Networks. SODA 2010: 817-826 - [c22]L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Local Dynamics in Bargaining Networks via Random-Turn Games. WINE 2010: 133-144 - [c21]Sourav Chakraborty, Nikhil R. Devanur, Chinmay Karande:
Market Equilibrium with Transaction Costs. WINE 2010: 496-504 - [i6]Sourav Chakraborty, Nikhil R. Devanur, Chinmay Karande:
Market Equilibrium with Transaction Costs. CoRR abs/1001.0393 (2010)
2000 – 2009
- 2009
- [j4]Deeparnab Chakrabarty, Nikhil R. Devanur:
On competitiveness in uniform utility allocation markets. Oper. Res. Lett. 37(3): 155-158 (2009) - [c20]Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. FOCS 2009: 293-302 - [c19]Nikhil R. Devanur, Jason D. Hartline:
Limited and online supply and the bayesian foundations of prior-free mechanism design. EC 2009: 41-50 - [c18]Nikhil R. Devanur, Thomas P. Hayes:
The adwords problem: online keyword matching with budgeted bidders under random permutations. EC 2009: 71-78 - [c17]Nikhil R. Devanur, Sham M. Kakade:
The price of truthfulness for pay-per-click auctions. EC 2009: 99-106 - [c16]Nikhil R. Devanur, Lance Fortnow:
A computational theory of awareness and decision making. TARK 2009: 99-107 - [c15]Sourav Chakraborty, Nikhil R. Devanur:
An Online Multi-unit Auction with Improved Competitive Ratio. WINE 2009: 79-88 - [i5]Sourav Chakraborty, Nikhil R. Devanur:
An Online Multi-unit Auction with Improved Competitive Ratio. CoRR abs/0901.1427 (2009) - [i4]Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. CoRR abs/0907.4356 (2009) - 2008
- [j3]Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani:
Market equilibrium via a primal-dual algorithm for a convex program. J. ACM 55(5): 22:1-22:18 (2008) - [j2]Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur:
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach. SIAM J. Discret. Math. 22(4): 1297-1324 (2008) - [c14]Nikhil R. Devanur, Ravi Kannan:
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents. FOCS 2008: 45-53 - [c13]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. IPCO 2008: 344-358 - [i3]Nikhil R. Devanur, Lance Fortnow:
A Computational Theory of Awareness and Decision Making. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c12]Chinmay Karande, Nikhil R. Devanur:
Computing Market Equilibrium: Beyond Weak Gross Substitutes. WINE 2007: 368-373 - [c11]Deeparnab Chakrabarty, Nikhil R. Devanur:
On Competitiveness in Uniform Utility Allocation Markets. WINE 2007: 374-380 - [i2]Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur:
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach. CoRR abs/math/0703927 (2007) - 2006
- [c10]Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi:
Integrality gaps for sparsest cut and minimum linear arrangement problems. STOC 2006: 537-546 - [c9]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets. WINE 2006: 239-250 - [i1]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j1]Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani:
Strategyproof cost-sharing mechanisms for set cover and facility location games. Decis. Support Syst. 39(1): 11-22 (2005) - [c8]Nikhil R. Devanur, Naveen Garg
Price of Anarchy, Locality Gap, and a Network Service Provider Game. WINE 2005: 1046-1055 - 2004
- [c7]Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi:
On the Complexity of Hilbert's 17th Problem. FSTTCS 2004: 237-249 - [c6]Nikhil R. Devanur:
The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results. STOC 2004: 519-528 - 2003
- [c5]Nikhil R. Devanur, Vijay V. Vazirani:
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. FSTTCS 2003: 149-155 - [c4]Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi:
Who's The Weakest Link? SAGA 2003: 108-116 - [c3]Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani:
Strategyproof cost-sharing mechanisms for set cover and facility location games. EC 2003: 108-114 - [c2]Nikhil R. Devanur, Vijay V. Vazirani:
Extensions of the spending constraint-model: existence and uniqueness of equilibria (extended abstract). EC 2003: 202-203 - 2002
- [c1]Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani:
Market Equilibrium via a Primal-Dual-Type Algorithm. FOCS 2002: 389-395
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: