Search results
Vijay Virkumar Vazirani (Hindi: विजय वीरकुमार वज़ीरानी; b. 1957) is an Indian American distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.
Vijay V. Vazirani. Distinguished Professor Computer Science Department University of California, Irvine Director, ACO Center @ UCI Ph.D., University of California, Berkeley S.B., Massachusetts Institute of Technology.
Vijay Vazirani. Distinguished Professor, Dept. of Computer Science, University of California, Irvine. Verified email at ics.uci.edu - Homepage.
He is one of the founders of algorithmic game theory, focusing on the computability of market equilibria. His current research is centered on matching-based market design. Vazirani is a Guggenheim Fellow, an ACM Fellow and the recipient of the 2022 INFORMS John von Neumann Theory Prize.
Vijay VAZIRANI, Professor (Full) | Cited by 21,249 | of Georgia Institute of Technology, Georgia (GT) | Read 286 publications | Contact Vijay VAZIRANI
Vazirani. Little Michel’s arrival, halfway through this project, brought new joys and energies, though made the end even more challenging! Above all, I would like to thank my parents for their unwavering support and inspira-tion – my father, a distinguished author of several Civil Engineering books,
Vazirani is one of the founders of algorithmic game theory, focusing on the computability of market equilibria. In a 2012 paper, he introduced the notion of a rational convex program, established that they “behave like” linear programs, and showed that certain market equilibria programs have this property.
Vijay V. Vazirani University of California, Irvine, Irvine, CA, USA May 2022 AAMAS '22: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems
Feb 15, 2023 · Vijay V. Vazirani. LP-duality theory has played a central role in the study of the core, right from its early days to the present time. However, despite the extensive nature of this work, basic gaps still remain. We address these gaps using the following building blocks from LP-duality theory: 1. Total unimodularity (TUM).
The Micali-Vazirani (MV) algorithm for maximum cardinality matching in general graphs, which was published in 1980 [Micali and Vazirani(1980)], remains to this day the most effi-cient known algorithm for the problem. This paper gives the first complete and correct proof of this algorithm.
