Fellow: Awarded 2011
Field of Study: Computer Science
Competition: US & Canada
Vijay Vazirani got his bachelor’s degree in Computer Science from MIT in 1979 and his Ph.D. from the University of California at Berkeley in 1983. He is currently Professor of Computing at Georgia Institute of Technology.
His research career has been centered around the design of efficient algorithms. During the 1980s, he made seminal contributions to the classical maximum matching problem and worked on the use of randomization for obtaining efficient algorithms as well as for proving computational intractability. During the 1990s he obtained approximation algorithms for several fundamental NP-hard optimization problems. And in the new millennium, he has worked extensively on understanding the computability of market equilibria.
In 2001 he published what was widely regarded as the definitive book on Approximation Algorithms. This book has been translated into Japanese, Polish, French and Chinese. In 2007, he co-edited a comprehensive volume on Algorithmic Game Theory.