World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
64
Citations
29992
World Ranking
2520
National Ranking
1258

Research.com Recognitions

  • 2011 - Fellow of John Simon Guggenheim Memorial Foundation
  • 2005 - ACM Fellow For contributions to optimization and approximation algorithms.

Overview

Vijay V. Vazirani is a researcher affiliated with the University of California, Irvine in the United States. Their scholarly work spans computer science, economics, econometrics, and decision sciences, with a significant focus on areas intersecting game theory, algorithms, and economic models.

Their main fields of study include:

  • Computer Science
  • Economics, Econometrics and Finance
  • Decision Sciences

Within these fields, Vazirani's work touches on several specialized subfields:

  • Economics and Econometrics
  • Management Science and Operations Research
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Discrete Mathematics and Combinatorics

The topics most frequently explored in Vazirani's publications are:

  • Game Theory and Voting Systems
  • Auction Theory and Applications
  • Game Theory and Applications
  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Economic theories and models
  • Logic, Reasoning, and Knowledge

Some of the recent scholarly papers authored or co-authored by Vazirani include:

  • Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets (2020), published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets (2020), published in arXiv (Cornell University)
  • One-sided matching markets with endowments: equilibria and algorithms (2024), published in Autonomous Agents and Multi-Agent Systems
  • The general graph matching game: Approximate core (2022), published in Games and Economic Behavior
  • A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length (2024), published in Mathematics of Operations Research

Frequent collaborators in Vazirani's research include:

  • Thorben Tröbst
  • Rohith Reddy Gangam
  • Mihalis Yannakakis
  • Jugal Garg
  • Federico Echenique

Vazirani has published extensively in a number of academic venues, especially:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Mathematics of Operations Research
  • SSRN Electronic Journal
  • Autonomous Agents and Multi-Agent Systems

Their academic contributions have been recognized by honors such as:

  • Fellow of John Simon Guggenheim Memorial Foundation, 2011
  • ACM Fellow, 2005, for contributions to optimization and approximation algorithms

Best Publications

  • Approximation Algorithms

    Vijay V. Vazirani

  • Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria

    Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani

  • Algorithmic Game Theory: Computing in Games

    Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani

  • NP is as easy as detecting unique solutions

    L. G. Valiant;V. V. Vazirani

  • An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

    Silvio Micali;Vijay V. Vazirani

  • Random generation of combinatorial structures from a uniform distribution

    Mark R. Jerrum;Leslie G. Valiant;Vijay V. Vazirani

  • Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

    Kamal Jain;Vijay V. Vazirani

  • AdWords and generalized online matching

    Aranyak Mehta;Amin Saberi;Umesh Vazirani;Vijay Vazirani

  • Matching is as easy as matrix inversion

    Ketan Mulmuley;Umesh V. Vazirani;Vijay V. Vazirani

  • An optimal algorithm for on-line bipartite matching

    R. M. Karp;U. V. Vazirani;V. V. Vazirani

  • Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

  • Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

    Kamal Jain;Mohammad Mahdian;Evangelos Markakis;Amin Saberi

  • Primal-dual approximation algorithms for integral flow and multicut in trees

    N. Garg;V. V. Vazirani;M. Yannakakis

  • Random generation of combinatorial structures from a uniform

    M R Jerrum;L G Valiant;V V Vazirani

  • Finding $k$ Cuts within Twice the Optimal

    Huzur Saran;Vijay V. Vazirani

  • Diversity in times of adversity: probabilistic strategies in microbial survival games.

    Denise M. Wolf;Vijay V. Vazirani;Adam P. Arkin

  • AdWords and generalized on-line matching

    A. Mehta;A. Saberi;U. Vazirani;V. Vazirani

  • Primal-dual approximation algorithms for metric facility location and k-median problems

    K. Jain;V.V. Vazirani

  • NP-completeness of some generalizations of the maximum matching problem

    Larry J. Stockmeyer;Vijay V. Vazirani

  • A primal-dual approximation algorithm for generalized steiner network problems

    David P. Williamson;Michel X. Goemans;Milena Mihail;Vijay V. Vazirani

  • Market equilibrium via a primal-dual-type algorithm

    N.R. Devanur;C.H. Papadimitriou;A. Saberi;V.V. Vazirani

  • Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

Frequent Co-Authors

Kamal Jain
Kamal Jain Microsoft (United States)
Umesh Vazirani
Umesh Vazirani University of California, Berkeley
Nikhil R. Devanur
Nikhil R. Devanur Amazon (United States)
Mihalis Yannakakis
Mihalis Yannakakis Columbia University
Naveen Garg
Naveen Garg Indian Institute of Technology Delhi
Éva Tardos
Éva Tardos Cornell University
Amin Saberi
Amin Saberi Stanford University
Tim Roughgarden
Tim Roughgarden Columbia University
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
Nick Feamster
Nick Feamster University of Chicago

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a variety of online computer science degree options. These accelerated programs can fast-track your learning and make it easier to balance education with work or personal commitments.

Students with a less competitive academic record also have opportunities. Some institutions offer online graduate programs that accept 2.0 gpa, allowing more flexibility for those aiming to advance in their careers despite a lower undergraduate GPA.

If you are interested in environmental impact or sustainability, you might want to explore additional fields. Learning about what can you get with an environmental science degree can highlight diverse roles from policy advisor to field researcher.

For those seeking a technical approach to environmental challenges, consider an environmental engineering degree. Many universities now offer affordable online options that align with STEM career growth and the drive for innovation in sustainability.

Best Scientists Citing Vijay V. Vazirani

Trending Scientists

Recently Published Articles