2000 character limit reached
The Strongly Stable Matching Problem with Closures (2401.02666v1)
Published 5 Jan 2024 in cs.GT
Abstract: In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the stability concepts in this setting. In this paper, we consider the following variant of strong stability, and we consider computational complexity issues for this solution concept. In our setting, we are given a subset of the agents on one side. Then when an agent in this subset is not matched to any partner, this agent cannot become a part of a blocking pair. In this paper, we first prove that the problem of determining the existence of a stable matching in this setting is NP-complete. Then we give two polynomial-time solvable cases of our problem. Interestingly, one of our positive results gives a unified approach to the strongly stable matching problem and the envy-free matching problem.
- Approximation hardness of short symmetric instances of MAX-3SAT. Electronic Colloquium on Computational Complexity, (049), 2003.
- Strongly stable assignment. In Mark de Berg and Ulrich Meyer, editors, Proceedings of the 18th Annual European Symposium on Algorithms, Part II, volume 6347 of Lecture Notes in Computer Science, pages 147–158, Berlin, Heidelberg, Germany, 2010. Springer.
- College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9–15, 1962.
- Envy-freeness in house allocation problems. Mathematical Social Sciences, 101:104–106, 2019.
- Philip Hall. On representatives of subsets. Journal of the London Mathematical Society, 1(1):26–30, 1935.
- An n5/2superscript𝑛52n^{5/2}italic_n start_POSTSUPERSCRIPT 5 / 2 end_POSTSUPERSCRIPT algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225–231, 1973.
- Robert W. Irving. Stable marriage and indifference. Discrete Applied Mathematics, 48(3):261–272, 1994.
- Strong stability in the hospitals/residents problem. In Helmut Alt and Michel Habib, editors, Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes in Computer Science, pages 439–450, Berlin, Heidelberg, Germany, 2003. Springer.
- The stable marriage problem with master preference lists. Discrete Applied Mathematics, 156(15):2959–2977, 2008.
- Stable marriage with ties and incomplete lists. In Ming-Yang Kao, editor, Encyclopedia of Algorithms. Springer, Boston, MA, 2008 edition, 2008.
- Naoyuki Kamiyama. A note on the serial dictatorship with project closures. Operations Research Letters, 41(5):559–561, 2013.
- Naoyuki Kamiyama. Stable matchings with ties, master preference lists, and matroid constraints. In Martin Hoefer, editor, Proceedings of the 8th International Symposium on Algorithmic Game Theory, volume 9347 of Lecture Notes in Computer Science, pages 3–14, Berlin, Heidelberg, Germany, 2015. Springer.
- Naoyuki Kamiyama. Many-to-many stable matchings with ties, master preference lists, and matroid constraints. In Edith Elkind, Manuela Veloso, Noa Agmon, and Matthew E. Taylor, editors, Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems, pages 583–591, Richland, SC, 2019. International Foundation for Autonomous Agents and Multiagent Systems.
- Strongly stable matchings in time O(nm)𝑂𝑛𝑚O(nm)italic_O ( italic_n italic_m ) and extension to the hospitals-residents problem. ACM Transactions on Algorithms, 3(2):Article 15, 2007.
- Adam Kunysz. An algorithm for the maximum weight strongly stable matching problem. In Wen-Lian Hsu, Der-Tsai Lee, and Chung-Shou Liao, editors, Proceedings of the 29th International Symposium on Algorithms and Computation, volume 123 of Leibniz International Proceedings in Informatics, pages 42:1–42:13, Wadern, Germany, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
- Adam Kunysz. A faster algorithm for the strongly stable b𝑏bitalic_b-matching problem. In Pinar Heggernes, editor, Proceedings of the 11th International Conference on Algorithms and Complexity, volume 11485 of Lecture Notes in Computer Science, pages 299–310, Cham, Switzerland, 2019. Springer.
- Characterisation of strongly stable matchings. In Robert Krauthgamer, editor, Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 107–119, Philadelphia, PA, 2016. Society for Industrial and Applied Mathematics.
- Varun S. Malhotra. On the stability of multiple partner stable marriages with ties. In Susanne Albers and Tomasz Radzik, editors, Proceedings of the 12th Annual European Symposium on Algorithms, volume 3221 of Lecture Notes in Computer Science, pages 508–519, Berlin, Heidelberg, Germany, 2004. Springer.
- David F. Manlove. Stable marriage with ties and unacceptable partners. Technical Report TR-1999-29, The University of Glasgow, Department of Computing Science, 1999.
- David F. Manlove. Algorithmics of Matching under Preferences. World Scientific, Singapore, 2013.
- Matching with quorums. Economics Letters, 120(1):14–17, 2013.
- Kazuo Murota. Discrete Convex Analysis, volume 10 of SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2003.
- An algorithm for strong stability in the student-project allocation problem with ties. In Manoj Changat and Sandip Das, editors, Proceedings of the 8th Annual International Conference on Algorithms and Discrete Applied Mathematics, volume 12016 of Lecture Notes in Computer Science, pages 384–399, Cham, Switzerland, 2020. Springer.
- Gregg O’Malley. Algorithmic Aspects of Stable Matching Problems. PhD thesis, The University of Glasgow, 2007.
- Alexander Schrijver. Combinatorial Optimization: Polyhedra and Efficiency, volume 24 of Algorithms and Combinatorics. Springer, Berlin, Heidelberg, Germany, 2002.