Document Open Access Logo

Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences

Authors Ágnes Cseh , Guillaume Escamocher , Luis Quesada

PDF
Thumbnail PDF

File

LIPIcs.CP.2022.16.pdf
  • Filesize: 1.03 MB
  • 19 pages

Document Identifiers

Author Details

Ágnes Cseh
  • Institute of Economics, Centre for Economic and Regional Studies, Budapest, Hungary
Guillaume Escamocher
  • Insight Centre for Data Analytics, School of Computer Science and Information Technology, University College Cork, Ireland
Luis Quesada
  • Insight Centre for Data Analytics, School of Computer Science and Information Technology, University College Cork, Ireland

Funding

This publication has emanated from research conducted with the financial support of Science Foundation Ireland under Grant numbers 12/RC/2289-P2 and 16/SP/3804, which are co-funded under the European Regional Development Fund. Cseh was supported by OTKA grant K128611 and the János Bolyai Research Fellowship.

Acknowledgements

COST Action CA16228 European Network for Game Theory.

Cite AsGet BibTex

Ágnes Cseh, Guillaume Escamocher, and Luis Quesada. Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 16:1-16:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.CP.2022.16

Abstract

Constraint programming has proven to be a successful framework for determining whether a given instance of the three-dimensional stable matching problem with cyclic preferences (3dsm-cyc) admits a solution. If such an instance is satisfiable, constraint models can even compute its optimal solution for several different objective functions. On the other hand, the only existing output for unsatisfiable 3dsm-cyc instances is a simple declaration of impossibility. In this paper, we explore four ways to adapt constraint models designed for 3dsm-cyc to the maximum relaxation version of the problem, that is, the computation of the smallest part of an instance whose modification leads to satisfiability. We also extend our models to support the presence of costs on elements in the instance, and to return the relaxation with lowest total cost for each of the four types of relaxation. Empirical results reveal that our relaxation models are efficient, as in most cases, they show little overhead compared to the satisfaction version.

Subject Classification

ACM Subject Classification
  • Theory of computation → Constraint and logic programming
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Three-dimensional stable matching with cyclic preferences
  • 3dsm-cyc
  • Constraint Programming
  • relaxation
  • almost stable matching

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Supplementary Materials

References

  1. David J. Abraham, Péter Biró, and David F. Manlove. "Almost stable" matchings in the roommates problem. In Thomas Erlebach and Giuseppe Persiano, editors, Proceedings of WAOA '05: the 3rd Workshop on Approximation and Online Algorithms, volume 3879 of Lecture Notes in Computer Science, pages 1-14. Springer, 2006. Google Scholar
  2. David J Abraham, Ariel Levavi, David F Manlove, and Gregg O'Malley. The stable roommates problem with globally-ranked pairs. Internet Mathematics, 5:493-515, 2008. Google Scholar
  3. Péter Biró. Applications of matching models under preferences. Trends in Computational Social Choice, page 345, 2017. Google Scholar
  4. Péter Biró, Robert W Irving, and Ildikó Schlotter. Stable matching with couples: An empirical study. Journal of Experimental Algorithmics (JEA), 16:Article no. 1.2, 2011. Google Scholar
  5. Péter Biró, David F. Manlove, and Eric J. McDermid. "Almost stable" matchings in the roommates problem with bounded preference lists. Theoretical Computer Science, 432:10-20, 2012. Google Scholar
  6. Péter Biró, David F. Manlove, and Shubham Mittal. Size versus stability in the marriage problem. Theoretical Computer Science, 411:1828-1841, 2010. Google Scholar
  7. Péter Biró and Eric McDermid. Three-sided stable matchings with cyclic preferences. Algorithmica, 58(1):5-18, 2010. URL: https://doi.org/10.1007/s00453-009-9315-2.
  8. Francis Bloch, David Cantala, and Damián Gibaja. Matching through institutions. Games Econ. Behav., 121:204-231, 2020. URL: https://doi.org/10.1016/j.geb.2020.01.010.
  9. Niclas Boehmer, Robert Bredereck, Klaus Heeger, and Rolf Niedermeier. Bribery and control in stable marriage. Journal of Artificial Intelligence Research, 71:993-1048, 2021. Google Scholar
  10. Endre Boros, Vladimir Gurvich, Steven Jaslar, and Daniel Krasner. Stable matchings in three-sided systems with cyclic preferences. Discrete Mathematics, 289(1-3):1-10, 2004. URL: https://doi.org/10.1016/j.disc.2004.08.012.
  11. Jiehua Chen, Danny Hermelin, Manuel Sorge, and Harel Yedidsion. How hard is it to satisfy (almost) all roommates? In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018. Google Scholar
  12. Geoffrey Chu. Improving combinatorial optimization. PhD thesis, University of Melbourne, Australia, 2011. URL: https://hdl.handle.net/11343/36679.
  13. Ágnes Cseh, Guillaume Escamocher, Begüm Genç, and Luis Quesada. A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), Montpellier, France, 25-29 October 2021, pages 1-19. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021. Google Scholar
  14. Ágnes Cseh, Robert W. Irving, and David F. Manlove. The stable roommates problem with short lists. Theory of Computing Systems, 63(1):128-149, 2019. Google Scholar
  15. Ágnes Cseh and Jannik Peters. Three-dimensional popular matching with cyclic preferences. CoRR, abs/2105.09115, 2021. URL: http://arxiv.org/abs/2105.09115.
  16. Lin Cui and Weijia Jia. Cyclic stable matching for three-sided networking services. Comput. Networks, 57(1):351-363, 2013. URL: https://doi.org/10.1016/j.comnet.2012.09.021.
  17. Vânia M.F. Dias, Guilherme D. Da Fonseca, Celina M.H. De Figueiredo, and Jayme L. Szwarcfiter. The stable marriage problem with restricted pairs. Theoretical Computer Science, 306:391-405, 2003. Google Scholar
  18. Ulrich Dorndorf, Erwin Pesch, and Toàn Phan-Huy. Solving the open shop scheduling problem. Journal of Scheduling, 4(3):157-174, 2001. Google Scholar
  19. Kimmo Eriksson and Olle Häggström. Instability of matchings in decentralized markets with various preference structures. International Journal of Game Theory, 36(3-4):409-420, 2008. Google Scholar
  20. Kimmo Eriksson, Jonas Sjöstrand, and Pontus Strimling. Three-dimensional stable matching with cyclic preferences. Mathematical Social Sciences, 52(1):77-87, 2006. URL: https://doi.org/10.1016/j.mathsocsci.2006.03.005.
  21. Tomás Feder. A new fixed point approach for stable networks and stable marriages. Journal of Computer and System Sciences, 45(2):233-284, 1992. URL: https://doi.org/10.1016/0022-0000(92)90048-N.
  22. Tomás Feder. Network flow and 2-satisfiability. Algorithmica, 11(3):291-319, 1994. URL: https://doi.org/10.1007/BF01240738.
  23. Tamás Fleiner, Robert W. Irving, and David F. Manlove. Efficient algorithms for generalised stable marriage and roommates problems. Theoretical Computer Science, 381:162-176, 2007. Google Scholar
  24. David Gale and Lloyd S. Shapley. College admissions and the stability of marriage. American Mathematical Monthly, 120(5):386-391, 1962. URL: https://doi.org/10.4169/amer.math.monthly.120.05.386.
  25. Gecode Team. Gecode: Generic constraint development environment, 2019. Available from http://www.gecode.org. Google Scholar
  26. Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, and Barbara M. Smith. A constraint programming approach to the stable marriage problem. In Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, volume 2239, pages 225-239. Springer, 2001. URL: https://doi.org/10.1007/3-540-45578-7_16.
  27. Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, and Meirav Zehavi. On the (Parameterized) Complexity of Almost Stable Marriage. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), volume 182 of Leibniz International Proceedings in Informatics (LIPIcs), pages 24:1-24:17, Dagstuhl, Germany, 2020. Schloss Dagstuhl-Leibniz-Zentrum für Informatik. Google Scholar
  28. Dan Gusfield and Robert W. Irving. The Stable marriage problem - structure and algorithms. MIT Press, 1989. Google Scholar
  29. Koki Hamada, Kazuo Iwama, and Shuichi Miyazaki. An improved approximation lower bound for finding almost stable maximum matchings. Information Processing Letters, 109:1036-1040, 2009. Google Scholar
  30. Stephen P. Heyneman, Kathryn H. Anderson, and Nazym Nuraliyeva. The cost of corruption in higher education. Comparative Education Review, 52(1):1-25, 2008. Google Scholar
  31. Robert W. Irving, Paul Leather, and Dan Gusfield. An efficient algorithm for the "optimal" stable marriage. Journal of the ACM, 34(3):532-543, 1987. URL: https://doi.org/10.1145/28869.28871.
  32. Akiko Kato. Complexity of the sex-equal stable marriage problem. Japan Journal of Industrial and Applied Mathematics, 10:1-19, 1993. Google Scholar
  33. Samir Khuller, Stephen G. Mitchell, and Vijay V. Vazirani. On-line algorithms for weighted bipartite matching and stable marriages. Theoretical Computer Science, 127:255-267, 1994. Google Scholar
  34. Donald E. Knuth. Mariages Stables. Les Presses de L'Université de Montréal, 1976. English translation in Stable Marriage and its Relation to Other Combinatorial Problems, volume 10 of CRM Proceedings and Lecture Notes, American Mathematical Society, 1997. Google Scholar
  35. Augustine Kwanashie. Efficient algorithms for optimal matching problems under preferences. PhD thesis, University of Glasgow, 2015. Google Scholar
  36. Chi-Kit Lam and C. Gregory Plaxton. On the existence of three-dimensional stable matchings with cyclic preferences. Theory of Computing Systems, pages 1-17, 2021. Google Scholar
  37. Qijun Liu and Yaping Peng. Corruption in college admissions examinations in china. International Journal of Educational Development, 41:104-111, 2015. Google Scholar
  38. David F. Manlove. Algorithmics of Matching Under Preferences, volume 2. WorldScientific, 2013. URL: https://doi.org/10.1142/8591.
  39. David F. Manlove, Gregg O'Malley, Patrick Prosser, and Chris Unsworth. A constraint programming approach to the hospitals / residents problem. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings, volume 4510, pages 155-170. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-72397-4_12.
  40. Eric McDermid and Robert W. Irving. Sex-equal stable matchings: Complexity and exact algorithms. Algorithmica, 68(3):545-570, 2014. Google Scholar
  41. Nicholas Nethercote, Peter J. Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck, and Guido Tack. Minizinc: Towards a standard CP modelling language. In Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings, volume 4741, pages 529-543. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-74970-7_38.
  42. Cheng Ng and Daniel S. Hirschberg. Three-dimensional stable matching problems. SIAM Journal on Discrete Mathematics, 4(2):245-252, 1991. URL: https://doi.org/10.1137/0404023.
  43. Gregg O'Malley. Algorithmic aspects of stable matching problems. PhD thesis, University of Glasgow, UK, 2007. URL: http://theses.gla.ac.uk/64/.
  44. Nikita Panchal and Seema Sharma. An efficient algorithm for three dimensional cyclic stable matching. International Journal of Engineering Research and Technology, 3(4), 2014. Google Scholar
  45. Kanstantsin Pashkovich and Laurent Poirrier. Three-dimensional stable matching with cyclic preferences. Optimization Letters, 14(8):2615-2623, 2020. URL: https://doi.org/10.1007/s11590-020-01557-4.
  46. Nitsan Perach, Julia Polak, and Uriel G. Rothblum. A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion. International Journal of Game Theory, 36(3-4):519-535, 2008. URL: https://doi.org/10.1007/s00182-007-0083-4.
  47. Neetu Raveendran, Yiyong Zha, Yunfei Zhang, Xin Liu, and Zhu Han. Virtual core network resource allocation in 5g systems using three-sided matching. In 2019 IEEE International Conference on Communications, ICC 2019, Shanghai, China, May 20-24, 2019, pages 1-6. IEEE, 2019. URL: https://doi.org/10.1109/ICC.2019.8762095.
  48. Tina Rezvanian. Integrating Data-Driven Forecasting and Large-Scale Optimization to Improve Humanitarian Response Planning and Preparedness. PhD thesis, Northeastern University, 2019. Google Scholar
  49. Alvin E. Roth and Xiaolin Xing. Turnaround time and bottlenecks in market clearing: Decentralized matching in the market for clinical psychologists. Journal of Political Economy, 105(2):284-329, 1997. Google Scholar
  50. Mohamed Siala and Barry O’Sullivan. Revisiting two-sided stability constraints. In International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pages 342-357. Springer, 2016. Google Scholar
  51. Mohamed Siala and Barry O’Sullivan. Rotation-based formulation for stable matching. In International Conference on Principles and Practice of Constraint Programming, pages 262-277. Springer, 2017. Google Scholar
  52. Mallory Soldner. Optimization and measurement in humanitarian operations: Addressing practical needs. PhD thesis, Georgia Institute of Technology, 2014. Google Scholar
  53. Chung-Piaw Teo and Jay Sethuraman. LP based approach to optimal stable matchings. In Michael E. Saks, editor, Proceedings of SODA '97: the 8th ACM-SIAM Symposium on Discrete Algorithms, pages 710-719. ACM-SIAM, 1997. Google Scholar
  54. Chung-Piaw Teo and Jay Sethuraman. The geometry of fractional stable matchings and its applications. Mathematics of Operations Research, 23:874-891, 1998. Google Scholar
  55. Chris Unsworth and Patrick Prosser. An n-ary constraint for the stable marriage problem. In Proceedings of the 5th Workshop on Modelling and Solving Problems with Constraints, held at IJCAI '05: the 19th International Joint Conference on Artificial Intelligence, pages 32-38, 2005. Google Scholar
  56. Chris Unsworth and Patrick Prosser. A specialised binary constraint for the stable marriage problem. In Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings, volume 3607, pages 218-233. Springer, 2005. URL: https://doi.org/10.1007/11527862_16.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact