Vijay V. Vazirani

257 papers A* 55A 13B 14C 1Misc 4Journal 130Unranked 36

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A generalization of von Neumann's reduction from the assignment problem to zero-sum games. Games Econ. Behav. Ilan Adler, Martin Bullinger, Vijay V. Vazirani
2026	J	`jnl`	Robust Stable Matchings: Dealing with Changes in Preferences. CoRR Rohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani
2026	J	`jnl`	Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids. Algorithmica Vijay V. Vazirani
2025	J	`jnl`	Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs. CoRR Vijay V. Vazirani
2025	J	`jnl`	Computational Complexity of the Hylland-Zeckhauser Mechanism for One-Sided Matching Markets. SIAM J. Comput. Vijay V. Vazirani, Mihalis Yannakakis
2025	—	`conf`	Fair Rent Division: New Budget and Rent Constraints. FSTTCS Rohith Reddy Gangam, Shayan Taherijam, Vijay V. Vazirani
2025	J	`jnl`	Fair Rent Division: New Budget and Rent Constraints. CoRR Rohith Reddy Gangam, Shayan Taherijam, Vijay V. Vazirani
2025	A	`conf`	Matching Markets with Chores. AAMAS Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2025	J	`jnl`	On the Core of the CoRR Rohith Reddy Gangam, Shayan Taherijam, Vijay V. Vazirani
2024	J	`jnl`	A Generalization of von Neumann's Reduction from the Assignment Problem to Zero-Sum Games. CoRR Ilan Adler, Martin Bullinger, Vijay V. Vazirani
2024	J	`jnl`	A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length. Math. Oper. Res. Vijay V. Vazirani
2024	A*	`conf`	Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability. EC Thorben Tröbst, Vijay V. Vazirani
2024	J	`jnl`	Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability. CoRR Thorben Tröbst, Vijay V. Vazirani
2024	J	`jnl`	Matching Markets with Chores. CoRR Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2024	J	`jnl`	One-sided matching markets with endowments: equilibria and algorithms. Auton. Agents Multi Agent Syst. Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2024	J	`jnl`	The Assignment Game: New Mechanisms for Equitable Core Imputations. CoRR Vijay V. Vazirani
2024	J	`jnl`	The Flow Game: Leximin and Leximax Core Imputations. CoRR Rohith Reddy Gangam, Naveen Garg, Parnian Shahkar, Vijay V. Vazirani
2024	B	`conf`	The Investment Management Game: Extending the Scope of the Notion of Core. SAGT Vijay V. Vazirani
2024	—	`conf`	Time-Efficient Algorithms for Nash-Bargaining-Based Matching Market Models. WINE Ioannis Panageas, Thorben Tröbst, Vijay V. Vazirani
2023	A	`conf`	A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities. AAMAS Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2023	J	`jnl`	A Structural and Algorithmic Study of Stable Matching Lattices of Multiple Instances. CoRR Rohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani
2023	J	`jnl`	A real polynomial for bipartite graph minimum weight perfect matchings. Inf. Process. Lett. Thorben Tröbst, Vijay V. Vazirani
2023	J	`jnl`	LP-Duality Theory and the Cores of Games. CoRR Vijay V. Vazirani
2023	J	`jnl`	The Investment Management Game: Extending the Scope of the Notion of Core. CoRR Vijay V. Vazirani
2023	—	`conf`	Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids. FSTTCS Vijay V. Vazirani
2023	J	`jnl`	Two-Sided Matching Markets: Impossibility Results on Existence of Efficient and Envy Free Solutions. CoRR Thorben Tröbst, Vijay V. Vazirani
2022	—	`conf`	A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications. FSTTCS Rohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani
2022	J	`jnl`	Cores of Games via Total Dual Integrality, with Applications to Perfect Graphs and Polymatroids. CoRR Vijay V. Vazirani
2022	J	`jnl`	Insights into the Core of the Assignment Game via Complementarity. CoRR Vijay V. Vazirani
2022	A	`conf`	Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu. ITCS Mojtaba Hosseini, Vijay V. Vazirani
2022	—	`conf`	New Characterizations of Core Imputations of Matching and b-Matching Games. FSTTCS Vijay V. Vazirani
2022	A	`conf`	One-Sided Matching Markets with Endowments: Equilibria and Algorithms. AAMAS Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2022	B	`conf`	Online Bipartite Matching and Adwords (Invited Talk). MFCS Vijay V. Vazirani
2022	J	`jnl`	The general graph matching game: Approximate core. Games Econ. Behav. Vijay V. Vazirani
2021	J	`jnl`	Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite. CoRR Ioannis Panageas, Thorben Tröbst, Vijay V. Vazirani
2021	A	`conf`	Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets. ITCS Vijay V. Vazirani, Mihalis Yannakakis
2021	J	`jnl`	NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs. SIAM J. Comput. David Eppstein, Vijay V. Vazirani
2021	J	`jnl`	Nash-Bargaining-Based Models for Matching Markets, with Implementations and Experimental Results. CoRR Mojtaba Hosseini, Vijay V. Vazirani
2021	J	`jnl`	Randomized Online Algorithms for Adwords. CoRR Vijay V. Vazirani
2021	J	`jnl`	The General Graph Matching Game: Approximate Core. CoRR Vijay V. Vazirani
2020	J	`jnl`	A Proof of the MV Matching Algorithm. CoRR Vijay V. Vazirani
2020	J	`jnl`	A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings. CoRR Thorben Tröbst, Vijay V. Vazirani
2020	J	`jnl`	An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms. CoRR Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
2020	J	`jnl`	An Extension of the Birkhoff-von Neumann Theorem to Non-Bipartite Graphs. CoRR Vijay V. Vazirani
2020	J	`jnl`	An incentive compatible, efficient market for air traffic flow management. Theor. Comput. Sci. Ruta Mehta, Vijay V. Vazirani
2020	J	`jnl`	Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets. CoRR Vijay V. Vazirani, Mihalis Yannakakis
2020	A	`conf`	Matching Is as Easy as the Decision Problem, in the NC Model. ITCS Nima Anari, Vijay V. Vazirani
2020	J	`jnl`	Planar Graph Perfect Matching Is in NC. J. ACM Nima Anari, Vijay V. Vazirani
2020	—	`conf`	Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds. FSTTCS Karthik Gajulapalli, James A. Liu, Tung Mai, Vijay V. Vazirani
2019	J	`jnl`	A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching. CoRR Nima Anari, Vijay V. Vazirani
2019	J	`jnl`	Further Results on Stability-Preserving Mechanisms for School Choice. CoRR Karthik Gajulapalli, James A. Liu, Vijay V. Vazirani
2019	B	`conf`	NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs. SPAA David Eppstein, Vijay V. Vazirani
2019	J	`jnl`	Stability-Preserving, Incentive-Compatible, Time-Efficient Mechanisms for Increasing School Capacity. CoRR Tung Mai, Vijay V. Vazirani
2018	J	`jnl`	A Generalization of Birkhoff's Theorem for Distributive Lattices, with Applications to Robust Stable Matchings. CoRR Tung Mai, Vijay V. Vazirani
2018	J	`jnl`	A Natural Generalization of Stable Matching Solved via New Insights into Ideal Cuts. CoRR Tung Mai, Vijay V. Vazirani
2018	A*	`conf`	A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications. SODA Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
2018	A*	`conf`	Cycles in Zero-Sum Differential Games and Biological Diversity. EC Tung Mai, Milena Mihail, Ioannis Panageas, Will Ratcliff, Vijay V. Vazirani, Peter Yunker
2018	A	`conf`	Finding Stable Matchings That Are Robust to Errors in the Input. ESA Tung Mai, Vijay V. Vazirani
2018	J	`jnl`	Finding Stable Matchings that are Robust to Errors in the Input. CoRR Tung Mai, Vijay V. Vazirani
2018	J	`jnl`	NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs. CoRR David Eppstein, Vijay V. Vazirani
2018	A*	`conf`	Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. SODA Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani
2018	A*	`conf`	Planar Graph Perfect Matching Is in NC. FOCS Nima Anari, Vijay V. Vazirani
2018	J	`jnl`	Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm. Math. Oper. Res. Jugal Garg, Ruta Mehta, Vijay V. Vazirani
2018	J	`jnl`	∃R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria. ACM Trans. Economics and Comput. Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
2017	—	`conf`	A Performance-Based Scheme for Pricing Resources in the Cloud. WINE Kamal Jain, Tung Mai, Vijay V. Vazirani
2017	Misc	`conf`	An Incentive Compatible, Efficient Market for Air Traffic Flow Management. COCOON Ruta Mehta, Vijay V. Vazirani
2017	J	`jnl`	Concave Flow on Small Depth Directed Networks. CoRR Tung Mai, Richard Peng, Anup B. Rao, Vijay V. Vazirani
2017	A*	`conf`	Convex Program Duality, Fisher Markets, and Nash Social Welfare. EC Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod
2017	A	`conf`	Mutation, Sexual Reproduction and Survival in Dynamic Environments. ITCS Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani
2017	A*	`conf`	Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. ICALP Tung Mai, Ioannis Panageas, Vijay V. Vazirani
2017	J	`jnl`	Planar Graph Perfect Matching is in NC. CoRR Nima Anari, Vijay V. Vazirani
2017	—	`conf`	Probabilistic estimation of overlap graphs for large sequence datasets. BIBM Rahul Nihalani, Sriram P. Chockalingam, Shaowei Zhu, Vijay V. Vazirani, Srinivas Aluru
2017	J	`jnl`	Rock-Paper-Scissors, Differential Games and Biological Diversity. CoRR Tung Mai, Ioannis Panageas, Will Ratcliff, Vijay V. Vazirani, Peter Yunker
2017	A*	`conf`	Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria. STOC Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
2016	J	`jnl`	A Performance-Based Scheme for Pricing Resources in the Cloud. CoRR Kamal Jain, Tung Mai, Vijay V. Vazirani
2016	J	`jnl`	Convex Program Duality, Fisher Markets, and Nash Social Welfare. CoRR Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod
2016	J	`jnl`	Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP. Theory Comput. Jugal Garg, Ruta Mehta, Vijay V. Vazirani
2016	J	`jnl`	Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. CoRR Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani
2016	J	`jnl`	New Convex Programs for Fisher's Market Model and its Generalizations. CoRR Nikhil R. Devanur, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod
2016	J	`jnl`	Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. CoRR Tung Mai, Ioannis Panageas, Vijay V. Vazirani
2015	J	`jnl`	A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities. SIAM J. Comput. Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani
2015	J	`jnl`	A Market for Scheduling, with Applications to Cloud Computing. CoRR Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
2015	—	`conf`	Allocation of Divisible Goods Under Lexicographic Preferences. FSTTCS Leonard J. Schulman, Vijay V. Vazirani
2015	—	`conf`	ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria. ICALP (1) Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
2015	B	`conf`	Settling Some Open Problems on 2-Player Symmetric Nash Equilibria. SAGT Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
2015	J	`jnl`	The game of survival: Sexual evolution in dynamic environments. CoRR Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani
2014	A*	`conf`	Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions. STOC Jugal Garg, Ruta Mehta, Vijay V. Vazirani
2014	J	`jnl`	Equilibrium Computation (Dagstuhl Seminar 14342). Dagstuhl Reports Nimrod Megiddo, Kurt Mehlhorn, Rahul Savani, Vijay V. Vazirani
2014	—	`conf`	Learning Economic Parameters from Revealed Preferences. WINE Maria-Florina Balcan, Amit Daniely, Ruta Mehta, Ruth Urner, Vijay V. Vazirani
2014	J	`jnl`	Learning Economic Parameters from Revealed Preferences. CoRR Maria-Florina Balcan, Amit Daniely, Ruta Mehta, Ruth Urner, Vijay V. Vazirani
2014	J	`jnl`	Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness. CoRR Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
2014	A*	`conf`	On Computability of Equilibria in Markets with Production. SODA Jugal Garg, Vijay V. Vazirani
2014	J	`jnl`	Settling Some Open Problems on 2-Player Symmetric Nash Equilibria. CoRR Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
2014	J	`jnl`	Submodularity Helps in Nash and Nonsymmetric Bargaining Games. SIAM J. Discret. Math. Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu
2013	J	`jnl`	An Incentive Compatible, Efficient Market for Air Traffic Flow Management CoRR Ruta Mehta, Vijay V. Vazirani
2013	J	`jnl`	Computability of Equilibria in Markets with Production. CoRR Jugal Garg, Vijay V. Vazirani
2013	J	`jnl`	Nonseparable, Concave Utilities Are Easy - in a Perfect Price Discrimination Market Model. SIAM J. Discret. Math. Vijay V. Vazirani
2013	J	`jnl`	Thrifty Algorithms for Multistage Robust Optimization CoRR Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani
2013	B	`conf`	Thrifty Algorithms for Multistage Robust Optimization. IPCO Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani
2012	A*	`conf`	A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities. STOC Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani
2012	J	`jnl`	Allocation of Divisible Goods under Lexicographic Preferences CoRR Leonard J. Schulman, Vijay V. Vazirani
2012	J	`jnl`	An Improved Definition of Blossoms and a Simpler Proof of the MV Matching Algorithm CoRR Vijay V. Vazirani
2012	Misc	`conf`	Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"? CSR Vijay V. Vazirani
2012	J	`jnl`	Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games. SIAM J. Discret. Math. Vijay V. Vazirani
2012	A*	`conf`	The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game. SODA Vijay V. Vazirani
2012	J	`jnl`	The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game. J. ACM Vijay V. Vazirani
2011	J	`jnl`	A Market for Air Traffic Flow Management CoRR Vijay V. Vazirani
2011	J	`jnl`	A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It. Math. Oper. Res. Gagan Goel, Vijay V. Vazirani
2011	A*	`conf`	How many tiers?: pricing in the internet transit market. SIGCOMM Vytautas Valancius, Cristian Lumezanu, Nick Feamster, Ramesh Johari, Vijay V. Vazirani
2011	J	`jnl`	Market equilibrium under separable, piecewise-linear, concave utilities. J. ACM Vijay V. Vazirani, Mihalis Yannakakis
2011	J	`jnl`	Modeling Tiered Pricing in the Internet Transit Market CoRR Vytautas Valancius, Cristian Lumezanu, Nick Feamster, Ramesh Johari, Vijay V. Vazirani
2011	J	`jnl`	New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. Math. Program. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2010	—	`conf`	10171 Abstracts Collection - Equilibrium Computation. Equilibrium Computation Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Bernhard von Stengel, Vijay V. Vazirani
2010	B	`conf`	2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties. SAGT Vijay V. Vazirani
2010	B	`conf`	A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It. SAGT Gagan Goel, Vijay V. Vazirani
2010	J	`jnl`	Design is as Easy as Optimization. SIAM J. Discret. Math. Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
2010	J	`jnl`	Eisenberg-Gale markets: Algorithms and game-theoretic properties. Games Econ. Behav. Kamal Jain, Vijay V. Vazirani
2010	—	`ed.`	Equilibrium Computation, 25.04. - 30.04.2010 Equilibrium Computation Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Vijay V. Vazirani, Bernhard von Stengel
2010	J	`jnl`	Equilibrium Pricing of Digital Goods via a New Market Model CoRR Kamal Jain, Vijay V. Vazirani
2010	A	`conf`	Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities. ICS Vijay V. Vazirani, Mihalis Yannakakis
2010	J	`jnl`	Non-Separable, Quasiconcave Utilities are Easy -- in a Perfect Price Discrimination Market Model CoRR Vijay V. Vazirani
2010	—	`conf`	Non-separable, Quasiconcave Utilities are Easy - in a Perfect Price Discrimination Market Model (Extended Abstract). WINE Vijay V. Vazirani
2010	J	`jnl`	Rational Convex Programs, Their Feasibility, and the Arrow-Debreu Nash Bargaining Game CoRR Vijay V. Vazirani
2010	J	`jnl`	Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents. SIAM J. Discret. Math. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2010	J	`jnl`	Spending Constraint Utilities with Applications to the Adwords Market. Math. Oper. Res. Vijay V. Vazirani
2009	J	`jnl`	2-Player Nash and Nonsymmetric Bargaining via Flexible Budget Markets CoRR Vijay V. Vazirani
2009	—	`conf`	Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models. WINE Vijay V. Vazirani, Lei Wang
2008	J	`jnl`	Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. SIAM J. Comput. Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda
2008	J	`jnl`	Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models. Electron. Colloquium Comput. Complex. Vijay V. Vazirani, Lei Wang
2008	—	`conf`	Efficiency, Fairness and Competitiveness in Nash Bargaining Games. WINE Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu
2008	J	`jnl`	Equitable Cost Allocations via Primal--Dual-Type Algorithms. SIAM J. Comput. Kamal Jain, Vijay V. Vazirani
2008	A	`conf`	Fast monitoring of traffic subpopulations. Internet Measurement Conference Anirudh Ramachandran, Srinivasan Seetharaman, Nick Feamster, Vijay V. Vazirani
2008	A	`conf`	MINT: a Market for INternet Transit. CoNEXT Vytautas Valancius, Nick Feamster, Ramesh Johari, Vijay V. Vazirani
2008	J	`jnl`	Market equilibrium via a primal-dual algorithm for a convex program. J. ACM Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani
2008	C	`conf`	Nash Bargaining Via Flexible Budget Markets. AAIM Vijay V. Vazirani
2008	—	`conf`	Nash Bargaining Via Flexible Budget Markets. SWAT Vijay V. Vazirani
2008	B	`conf`	New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. IPCO Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2008	J	`jnl`	Random Bichromatic Matchings. Algorithmica Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda
2008	—	`conf`	Solvency Games. FSTTCS Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani
2008	J	`jnl`	Solvency Games. Electron. Colloquium Comput. Complex. Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani
2007	J	`jnl`	A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. Theor. Comput. Sci. Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani
2007	J	`jnl`	AdWords and generalized online matching. J. ACM Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
2007	—	`book`	Algorithmic Game Theory Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay V. Vazirani
2007	J	`jnl`	An auction-based market equilibrium algorithm for a production model. Theor. Comput. Sci. Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
2007	—	`conf`	Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets. WINE Nimrod Megiddo, Vijay V. Vazirani
2007	A*	`conf`	Eisenberg-Gale markets: algorithms and structural properties. STOC Kamal Jain, Vijay V. Vazirani
2007	—	`conf`	Markets and the Primal-Dual Paradigm. WINE Vijay V. Vazirani
2006	A*	`conf`	Accelerating simulated annealing for the permanent and combinatorial counting problems. SODA Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda
2006	—	`conf`	Design Is as Easy as Optimization. ICALP (1) Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
2006	J	`jnl`	Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2006	Misc	`conf`	Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping. International Conference on Computational Science (2) Mohammad Taghi Hajiaghayi, Kamal Jain, Lap Chi Lau, Ion I. Mandoiu, Alexander Russell, Vijay V. Vazirani
2006	—	`conf`	New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets. WINE Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2006	B	`conf`	On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs. ITW Kamal Jain, Vijay V. Vazirani, Gideon Yuval
2006	J	`jnl`	On the capacity of multiple unicast sessions in undirected graphs. IEEE Trans. Inf. Theory Kamal Jain, Vijay V. Vazirani, Gideon Yuval
2006	J	`jnl`	Posted price profit maximization for multicast by approximating fixed points. J. Algorithms Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
2006	B	`conf`	Random Bichromatic Matchings. LATIN Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda
2005	J	`jnl`	A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. Comb. Leonard J. Schulman, Vijay V. Vazirani
2005	—	`conf`	A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property. WINE Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani
2005	—	`conf`	A Simple Characterization for Truth-Revealing Single-Item Auctions. WINE Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani
2005	A*	`conf`	AdWords and Generalized On-line Matching. FOCS Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
2005	—	`conf`	An Auction-Based Market Equilibrium Algorithm for a Production Model. WINE Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
2005	A*	`conf`	Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. SODA Kamal Jain, Vijay V. Vazirani, Yinyu Ye
2005	B	`conf`	On the capacity of multiple unicast sessions in undirected graphs. ISIT Kamal Jain, Vijay V. Vazirani, Raymond W. Yeung, Gideon Yuval
2005	—	`conf`	Price of Anarchy, Locality Gap, and a Network Service Provider Game. WINE Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay V. Vazirani
2005	J	`jnl`	Strategyproof cost-sharing mechanisms for set cover and facility location games. Decis. Support Syst. Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani
2004	J	`jnl`	An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem. Algorithmica Kamal Jain, Vijay V. Vazirani
2004	—	`conf`	An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. APPROX-RANDOM Rahul Garg, Sanjiv Kapoor, Vijay V. Vazirani
2004	J	`jnl`	Multiway cuts in node weighted graphs. J. Algorithms Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
2004	A*	`conf`	Randomized truthful auctions of digital goods are randomizations over truthful auctions. EC Aranyak Mehta, Vijay V. Vazirani
2003	A*	`conf`	A stochastic process on the hypercube with applications to peer-to-peer networks. STOC Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani
2003	—	`conf`	An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. FSTTCS Nikhil R. Devanur, Vijay V. Vazirani
2003	A*	`conf`	Extensions of the spending constraint-model: existence and uniqueness of equilibria (extended abstract). EC Nikhil R. Devanur, Vijay V. Vazirani
2003	J	`jnl`	Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
2003	A*	`conf`	Profit-maximizing multicast pricing by approximating fixed points. EC Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
2003	A*	`conf`	Strategyproof cost-sharing mechanisms for set cover and facility location games. EC Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani
2002	J	`jnl`	A primal-dual schema based approximation algorithm for the element connectivity problem. J. Algorithms Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson
2002	—	`ed.`	Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings APPROX Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani
2002	A*	`conf`	Equitable cost allocations via primal-dual-type algorithms. STOC Kamal Jain, Vijay V. Vazirani
2002	J	`jnl`	Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP CoRR Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
2002	A*	`conf`	Market Equilibrium via a Primal-Dual-Type Algorithm. FOCS Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani
2001	—	`conf`	A Graph Theoretic Approach to Software Watermarking. Information Hiding Ramarathnam Venkatesan, Vijay V. Vazirani, Saurabh Sinha
2001	—	`conf`	A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. RANDOM-APPROX Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
2001	A*	`conf`	Applications of approximation algorithms to cooperative games. STOC Kamal Jain, Vijay V. Vazirani
2001	J	`jnl`	Approximation algorithms for metric facility location and J. ACM Kamal Jain, Vijay V. Vazirani
2001	—	`book`	Approximation algorithms. Vijay V. Vazirani
2000	J	`jnl`	A new heuristic for rectilinear Steiner trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley
2000	—	`conf`	An approximation algorithm for the fault tolerant metric facility location problem. APPROX Kamal Jain, Vijay V. Vazirani
2000	A	`conf`	Primal-Dual Schema Based Approximation Algorithms. Theoretical Aspects of Computer Science Vijay V. Vazirani
2000	J	`jnl`	Recent results on approximating the Steiner tree problem and its generalizations. Theor. Comput. Sci. Vijay V. Vazirani
1999	A*	`conf`	A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem. SODA Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson
1999	A	`conf`	A new heuristic for rectilinear Steiner trees. ICCAD Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley
1999	J	`jnl`	Finding Separator Cuts in Planar Graphs within Twice the Optimal. SIAM J. Comput. Naveen Garg, Huzur Saran, Vijay V. Vazirani
1999	A*	`conf`	Majorizing Estimators and the Approximation of #P-Complete Problems. STOC Leonard J. Schulman, Vijay V. Vazirani
1999	A*	`conf`	On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem. SODA Sridhar Rajagopalan, Vijay V. Vazirani
1999	A*	`conf`	Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. FOCS Kamal Jain, Vijay V. Vazirani
1998	J	`jnl`	Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs. SIAM J. Comput. Sridhar Rajagopalan, Vijay V. Vazirani
1998	J	`jnl`	The 'Art of Trellis Decoding' Is Computationally Hardi - For Large Fields. IEEE Trans. Inf. Theory Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani
1998	—	`conf`	The Steiner Tree Problem and Its Generalizations. APPROX Vijay V. Vazirani
1997	J	`jnl`	Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1996	A*	`conf`	An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. FOCS Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan
1996	J	`jnl`	An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. IEEE Trans. Inf. Theory Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan
1996	J	`jnl`	Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. SIAM J. Comput. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1995	J	`jnl`	A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. Comb. David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
1995	J	`jnl`	A polyhedron with all Math. Program. Naveen Garg, Vijay V. Vazirani
1995	J	`jnl`	Finding k Cuts within Twice the Optimal. SIAM J. Comput. Huzur Saran, Vijay V. Vazirani
1995	Misc	`conf`	Primal-Dual Schema Based Approximation Algorithms (Abstract). COCOON Vijay V. Vazirani
1994	—	`conf`	A Limited-Backtrack Greedy Schema for Approximation Algorithms. FSTTCS Vivek Arora, Santosh S. Vempala, Huzur Saran, Vijay V. Vazirani
1994	J	`jnl`	A Theory of Alternating Paths and Blossoms for Proving Correctness of the Comb. Vijay V. Vazirani
1994	A*	`conf`	Finding separator cuts in planar graphs within twice the optimal FOCS Naveen Garg, Huzur Saran, Vijay V. Vazirani
1994	A*	`conf`	Multiway Cuts in Directed and Node Weighted Graphs. ICALP Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1994	J	`jnl`	On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. Theor. Comput. Sci. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
1994	J	`jnl`	Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees. SIAM J. Comput. H. Narayanan, Huzur Saran, Vijay V. Vazirani
1993	B	`conf`	A polyhedron with all s-t cuts as vertices, and adjacency of cuts. IPCO Naveen Garg, Vijay V. Vazirani
1993	A*	`conf`	A primal-dual approximation algorithm for generalized Steiner network problems. STOC David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
1993	A*	`conf`	Approximate max-flow min-(multi)cut theorems and their applications. STOC Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1993	J	`jnl`	Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets. J. Algorithms David Pearson, Vijay V. Vazirani
1993	J	`jnl`	Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs. Inf. Process. Lett. Éva Tardos, Vijay V. Vazirani
1993	A*	`conf`	Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. ICALP Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
1993	A*	`conf`	Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs FOCS Sridhar Rajagopalan, Vijay V. Vazirani
1992	J	`jnl`	Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph. SIAM J. Comput. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
1992	A*	`conf`	Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees. SODA H. Narayanan, Huzur Saran, Vijay V. Vazirani
1992	A*	`conf`	Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). ICALP Vijay V. Vazirani, Mihalis Yannakakis
1991	A*	`conf`	Finding k-cuts within Twice the Optimal FOCS Huzur Saran, Vijay V. Vazirani
1991	A*	`conf`	On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. ICALP Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
1991	J	`jnl`	Planar Graph Coloring is not Self-Reducible, Assuming P != NP. Theor. Comput. Sci. Samir Khuller, Vijay V. Vazirani
1991	B	`conf`	Representing and Enumerating Edge Connectivity Cuts in RNC. WADS Dalit Naor, Vijay V. Vazirani
1990	—	`conf`	A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. FSTTCS David Pearson, Vijay V. Vazirani
1990	B	`conf`	A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm. IPCO Vijay V. Vazirani
1990	A*	`conf`	An Optimal Algorithm for On-line Bipartite Matching STOC Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani
1989	J	`jnl`	Maximum Matchings in General Graphs Through Randomization. J. Algorithms Michael O. Rabin, Vijay V. Vazirani
1989	J	`jnl`	NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems Inf. Comput. Vijay V. Vazirani
1989	J	`jnl`	Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. Discret. Appl. Math. Vijay V. Vazirani, Mihalis Yannakakis
1989	A*	`conf`	Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph FOCS Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
1989	J	`jnl`	The Two-Processor Scheduling Problem is in Random NC. SIAM J. Comput. Umesh V. Vazirani, Vijay V. Vazirani
1988	—	`conf`	NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems. SWAT Vijay V. Vazirani
1988	A*	`conf`	Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. ICALP Vijay V. Vazirani, Mihalis Yannakakis
1987	J	`jnl`	Global Wire Routing in Two-Dimensional Arrays. Algorithmica Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani
1987	A*	`conf`	Matching Is as Easy as Matrix Inversion STOC Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani
1987	J	`jnl`	Matching is as easy as matrix inversion. Comb. Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani
1986	J	`jnl`	NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci. Leslie G. Valiant, Vijay V. Vazirani
1986	J	`jnl`	Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani
1986	—	`conf`	Sampling a Population with a Semi-Random Source. FSTTCS Umesh V. Vazirani, Vijay V. Vazirani
1985	—	`conf`	NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. FSTTCS Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani
1985	A*	`conf`	NP Is as Easy as Detecting Unique Solutions STOC Leslie G. Valiant, Vijay V. Vazirani
1985	A*	`conf`	Random Polynomial Time Is Equal to Slightly-random Polynomial Time FOCS Umesh V. Vazirani, Vijay V. Vazirani
1985	A*	`conf`	The Two-Processor Scheduling Problem is in R-NC STOC Umesh V. Vazirani, Vijay V. Vazirani
1984	A*	`conf`	Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) FOCS Umesh V. Vazirani, Vijay V. Vazirani
1984	A*	`conf`	Efficient and Secure Pseudo-Random Number Generation. CRYPTO Umesh V. Vazirani, Vijay V. Vazirani
1983	J	`jnl`	A Natural Encoding Scheme Proved Probabilistic Polynomial Complete. Theor. Comput. Sci. Umesh V. Vazirani, Vijay V. Vazirani
1983	A*	`conf`	Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) FOCS Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani
1983	A*	`conf`	RSA Bits are 732+epsilon Secure. CRYPTO Umesh V. Vazirani, Vijay V. Vazirani
1983	A*	`conf`	Reducibility Among Protocols. CRYPTO Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani
1983	A*	`conf`	Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design FOCS Umesh V. Vazirani, Vijay V. Vazirani
1982	A*	`conf`	A Natural Encoding Scheme Proved Probabilistic Polynomial Complete FOCS Umesh V. Vazirani, Vijay V. Vazirani
1982	J	`jnl`	NP-Completeness of Some Generalizations of the Maximum Matching Problem. Inf. Process. Lett. Larry J. Stockmeyer, Vijay V. Vazirani
1982	J	`jnl`	Scheduling open shops with parallel machines. Oper. Res. Lett. Eugene L. Lawler, Michael George Luby, Vijay V. Vazirani
1980	A*	`conf`	An O(sqrt(\|v\|) \|E\|) Algorithm for Finding Maximum Matching in General Graphs FOCS Silvio Micali, Vijay V. Vazirani