Vijay Vazirani
· Distinguished Professor and Director, ACO Center (Algorithms, Combinatorics and Optimization)University of California, Irvine · Computer Science
Active 1977–2026
Academic metrics are sourced from OpenAlex and public funding records; values may differ from Google Scholar.
Research topics
- Computer Science
- Mathematical optimization
- Mathematical economics
- Mathematics
- Applied mathematics
- Economics
- Combinatorics
- Algorithm
- Discrete mathematics
Selected publications
An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms.
arXiv (Cornell University) · 2020 · 8 citations
Senior authorCorrespondingThe Arrow-Debreu extension of the classic Hylland-Zeckhauser scheme for a one-sided matching market -- called ADHZ in this paper -- has natural applications but has instances which do not admit equilibria. By introducing approximation, we define the $\\epsilon$-approximate ADHZ model. We give the following results. * Existence of equilibrium for the $\\epsilon$-approximate ADHZ model under linear utility functions. The equilibrium satisfies Pareto optimality, approximate envy-freeness and incent…
Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided\n Matching Markets
arXiv (Cornell University) · 2020 · 8 citations
1st authorCorrespondingIn 1979, Hylland and Zeckhauser \\cite{hylland} gave a simple and general\nscheme for implementing a one-sided matching market using the power of a\npricing mechanism. Their method has nice properties -- it is incentive\ncompatible in the large and produces an allocation that is Pareto optimal --\nand hence it provides an attractive, off-the-shelf method for running an\napplication involving such a market. With matching markets becoming ever more\nprevalant and impactful, it is imperative to fin…
One-sided matching markets with endowments: equilibria and algorithms
Autonomous Agents and Multi-Agent Systems · 2024-08-12 · 6 citations
articleSenior authorA Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length
Mathematics of Operations Research · 2024-05-07 · 5 citations
articleOpen access1st authorCorrespondingThe Micali–Vazirani (MV) algorithm for finding a maximum cardinality matching in general graphs, which was published in 1980, remains to this day the most efficient known algorithm for the problem. The current paper gives the first complete and correct proof of this algorithm. The MV algorithm resorts to finding minimum-length augmenting paths. However, such paths fail to satisfy an elementary property, called breadth first search honesty in this paper. In the absence of this property, an expone…
Computational Complexity of the Hylland–Zeckhauser Mechanism for One-Sided Matching Markets
SIAM Journal on Computing · 2025-03-03 · 2 citations
article1st authorCorresponding
Recent grants
Approximation Algorithms and Algorithmic Game Theory
NSF · $200k · 2005–2007
ICES: Large: Collaborative Research: Markets, Algorithms, Applications and the Digital Economy
NSF · $600k · 2012–2017
AF: Small: Algorithmic and Game-Theoretic Issues in Bargaining and Markets
NSF · $600k · 2009–2013
Frequent coauthors
- 43 shared
Aranyak Mehta
- 34 shared
Kamal Jain
- 32 shared
Ruta Mehta
- 29 shared
Prasad Tetali
- 28 shared
Tung Mai
- 28 shared
Umesh Vazirani
- 27 shared
Ramarathnam Venkatesan
SASTRA University
- 25 shared
Gerio Brito
Springer Nature (Germany)
Education
- 1980
Ph.D., Computer Science
Stanford University
- 1976
M.S., Computer Science
Stanford University
- 1974
Other, Computer Science and Engineering
Indian Institute of Technology, Kanpur
Awards & honors
- Hasso Plattner Endowed Chair in Artificial Intelligence
- 2023 INNS Dennis Gabor Award
Similar researchers at University of California, Irvine
- Resume-aware match score
- Save to shortlist
- AI-drafted outreach
See your match with Vijay Vazirani
PhdFit ranks faculty by your research interests, methods, and publications — grounded in their actual work, not templates.
- Free to start
- No credit card
- 30-second signup