Technical Appendix for Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem

Sulian Le Bozec-Chiffoleau (1, 2) , Charles Prud'Homme (1, 2) , Gilles Simonin (1, 2)

1 LS2N - équipe TASC - Théorie, Algorithmes et Systèmes en Contraintes
2 IMT Atlantique - DAPI - Département Automatique, Productique et Informatique

This document is the Technical Appendix for the paper "Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem" accepted at IJCAI-2024. Section 1 contains the complete proof of a lemma from the IJCAI paper. Section 2 describes the constraints used in the constraint programming model used in the paper, and Section 3 presents the full results of the experiments. In Section 4, there is a link to the GitHub repository containing the Java code for the experiments.

Mots clés: Social choice; Robustness; Stable matching; Preference reasoning; Combinatorial optimisation; Constraint programming

Domaines: Intelligence artificielle [cs.AI]

Sulian Le Bozec-Chiffoleau, Charles Prud'Homme, Gilles Simonin. Technical Appendix for Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem. IMT Atlantique. 2024. ⟨hal-04569962⟩