Published in: LIPIcs, Volume 250, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)
Rohith Reddy Gangam, Tung Mai, Nitya Raju, and Vijay V. Vazirani. A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 19:1-19:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gangam_et_al:LIPIcs.FSTTCS.2022.19, author = {Gangam, Rohith Reddy and Mai, Tung and Raju, Nitya and Vazirani, Vijay V.}, title = {{A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications}}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)}, pages = {19:1--19:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-261-7}, ISSN = {1868-8969}, year = {2022}, volume = {250}, editor = {Dawar, Anuj and Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.19}, URN = {urn:nbn:de:0030-drops-174114}, doi = {10.4230/LIPIcs.FSTTCS.2022.19}, annote = {Keywords: stable matching, robust solutions, finite distributive lattice, Birkhoff’s Representation Theorem} }
Published in: LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
Vijay V. Vazirani and Mihalis Yannakakis. Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 59:1-59:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{vazirani_et_al:LIPIcs.ITCS.2021.59, author = {Vazirani, Vijay V. and Yannakakis, Mihalis}, title = {{Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {59:1--59:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-177-1}, ISSN = {1868-8969}, year = {2021}, volume = {185}, editor = {Lee, James R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.59}, URN = {urn:nbn:de:0030-drops-135987}, doi = {10.4230/LIPIcs.ITCS.2021.59}, annote = {Keywords: Hyland-Zeckhauser scheme, one-sided matching markets, mechanism design, dichotomous utilities, PPAD, FIXP} }
Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)
Karthik Gajulapalli, James A. Liu, Tung Mai, and Vijay V. Vazirani. Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 21:1-21:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gajulapalli_et_al:LIPIcs.FSTTCS.2020.21, author = {Gajulapalli, Karthik and Liu, James A. and Mai, Tung and Vazirani, Vijay V.}, title = {{Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-174-0}, ISSN = {1868-8969}, year = {2020}, volume = {182}, editor = {Saxena, Nitin and Simon, Sunil}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.21}, URN = {urn:nbn:de:0030-drops-132626}, doi = {10.4230/LIPIcs.FSTTCS.2020.21}, annote = {Keywords: stable matching, mechanism design, NP-Hardness} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Tung Mai and Vijay V. Vazirani. Finding Stable Matchings That Are Robust to Errors in the Input. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 60:1-60:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{mai_et_al:LIPIcs.ESA.2018.60, author = {Mai, Tung and Vazirani, Vijay V.}, title = {{Finding Stable Matchings That Are Robust to Errors in the Input}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {60:1--60:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.60}, URN = {urn:nbn:de:0030-drops-95238}, doi = {10.4230/LIPIcs.ESA.2018.60}, annote = {Keywords: Stable Matching, Robust} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Tung Mai, Ioannis Panageas, and Vijay V. Vazirani. Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 140:1-140:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{mai_et_al:LIPIcs.ICALP.2017.140, author = {Mai, Tung and Panageas, Ioannis and Vazirani, Vijay V.}, title = {{Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {140:1--140:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.140}, URN = {urn:nbn:de:0030-drops-74440}, doi = {10.4230/LIPIcs.ICALP.2017.140}, annote = {Keywords: Opinion Dynamics, Convergence, Jacobian, Center-stable Manifold} }
Feedback for Dagstuhl Publishing