A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under diverse configurations. While several constraint models have been proposed for variants of the two-dimensional stable matching problem, we are the first to present constraint models for a higher number of dimensions. We show for all five models how to capture two different stability notions, namely weak and strong stability. Additionally, we translate some well-known fairness notions (i.e. sex-equal, minimum regret, egalitarian) into 3-dimensional matchings, and present how to capture them in each model. Our tests cover dozens of problem sizes and four different instance generation methods. We explore two levels of commitment in our models: one where we have an individual variable for each agent (individual commitment), and another one where the determination of a variable involves pairing the three agents at once (group commitment). Our experiments show that the suitability of the commitment depends on the type of stability we are dealing with. Our experiments not only led us to discover dependencies between the type of stability and the instance generation method, but also brought light to the role that learning and restarts can play in solving this kind of problems.
Three-dimensional stable matching with cyclic preferences , 3DSM-cyc , Constraint Programming , Fairness
Cseh, Á, Escamocher, G., Genç, B. and Quesada, L. (2021) 'A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences', 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), Montpellier, France, 25 - 29 October, 22 (19pp). doi: 10.4230/LIPIcs.CP.2021.22