15 citations · 75 across the 31 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018★ 4 cited
A Natural Generalization of Stable Matching Solved via New Insights into Ideal Cuts
Tung Mai, Vijay V. Vazirani
We study a natural generalization of stable matching to the maximum weight stable matching problem and we obtain a combinatorial polynomial time algorithm for it by reducing it to…
cs.DM2018
A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications
Rohith Reddy Gangam, Tung Mai, Nitya Raju +1
Recently MV18 identified and initiated work on the new problem of understanding structural relationships between the lattices of solutions of two "nearby" instances of stable match…
cs.DS2018
Finding Stable Matchings that are Robust to Errors in the Input
Tung Mai, Vijay V. Vazirani
We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of err…