11 papers
Efficiently Restructuring Sovereign Debt via Arctic Auctions with Convex Costs
Jugal Garg, Edwin Lock, Vijay V. Vazirani
We study the problem of computing competitive equilibria in the Arctic product-mix auction, originally developed for the Icelandic government for exchanging blocked financial accou…
A Generalization of von Neumann's Reduction from the Assignment Problem to Zero-Sum Games
Ilan Adler, Martin Bullinger, Vijay V. Vazirani
The equivalence between von Neumann's Minimax Theorem for zero-sum games and the LP Duality Theorem connects cornerstone problems of the two fields of game theory and optimization,…
Robust Stable Matchings: Dealing with Changes in Preferences
Rohith Reddy Gangam, Tung Mai, Nitya Raju +1
We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley [GS62]. Given two instances and on the same set…
Stable Matching: Dealing with Changes in Preferences
Rohith Reddy Gangam, Tung Mai, Nitya Raju +1
We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley[GS62]. Given two instances and on the same set…
Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs
Vijay V. Vazirani
This paper unifies two foundational constructs from economics and algorithmic game theory, the Arctic Auction and the linear Fisher market, to address the efficient allocation of d…
Fair Core Imputations for the Assignment Game: New Solution Concepts and Efficient Algorithms
Vijay V. Vazirani
The assignment game is a classical model for profit sharing and a cornerstone of cooperative game theory. While an imputation in its core guarantees fairness among coalitions, it p…