default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVijay V. Vazirani
- > Home > Persons > Vijay V. Vazirani
Publications
- 2018
[c102]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- 2017
- [c97]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 - 2016
- [i27]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]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
- [i21]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) - 2011
- [j50]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) - 2010
- [j46]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) - 2008
- [j44]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) - [c74]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. IPCO 2008: 344-358 - 2006
- [c63]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 - [i2]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
- [j35]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) - [c56]Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay V. Vazirani:
Price of Anarchy, Locality Gap, and a Network Service Provider Game. WINE 2005: 1046-1055 - 2003
- [c53]Nikhil R. Devanur, Vijay V. Vazirani:
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. FSTTCS 2003: 149-155 - [c52]Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani:
Strategyproof cost-sharing mechanisms for set cover and facility location games. EC 2003: 108-114 - [c51]Nikhil R. Devanur, Vijay V. Vazirani:
Extensions of the spending constraint-model: existence and uniqueness of equilibria (extended abstract). EC 2003: 202-203 - 2002
- [c48]Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani:
Market Equilibrium via a Primal-Dual-Type Algorithm. FOCS 2002: 389-395
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 2026-03-06 22:47 CET 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:
