P. Codognet and D. Diaz, Yet Another Local Search Method for Constraint Solving, Stochastic Algorithms: Foundations and Applications, pp.342-344, 2001.
DOI : 10.1007/3-540-45322-9_5

URL : https://hal.archives-ouvertes.fr/hal-00667941

P. Codognet and D. Diaz, An Efficient Library for Solving CSP with Local Search, 5th international Conference on Metaheuristics, pp.1-6, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00693282

L. Dubins and D. Freedman, Machiavelli and the Gale-Shapley Algorithm, The American Mathematical Monthly, vol.88, issue.7, pp.485-494, 1981.
DOI : 10.2307/2321753

D. Gale and L. Shapley, College Admissions and the Stability of Marriage, The American Mathematical Monthly, vol.69, issue.1, pp.9-15, 1962.
DOI : 10.2307/2312726

M. Gelain, M. Pini, F. Rossi, K. Venable, and T. Walsh, Local Search Approaches in Stable Matching Problems, Local Search Approaches in Stable Matching Problems, pp.591-617, 2013.
DOI : 10.3390/a6040591

URL : http://doi.org/10.3390/a6040591

I. Gent and P. Prosser, An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists, ECAI 2002, pp.141-145, 2002.

I. Gent, P. Prosser, B. Smith, and T. Walsh, SAT Encodings of the Stable Marriage Problem with Ties and Incomplete Lists, SAT, pp.133-140, 2002.

F. Glover and M. Laguna, Tabu Search, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01389283

D. Gusfield and R. Irving, The Stable Marriage Problem: Structure and Algorithms, 1989.

R. Irving, Stable marriage and indifference, Discrete Applied Mathematics, vol.48, issue.3, pp.261-272, 1994.
DOI : 10.1016/0166-218X(92)00179-P

URL : http://doi.org/10.1016/0166-218x(92)00179-p

R. Irving and D. Manlove, Finding large stable matchings, Journal of Experimental Algorithmics, vol.14, 2009.
DOI : 10.1145/1498698.1537595

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. Irving, D. Manlove, and S. Scott, The Hospitals/Residents Problem with Ties, 7th Scandinavian Workshop on Algorithm Theory, SWAT'00 Lecture Notes in Computer Science, number i, pp.259-271, 2000.
DOI : 10.1007/3-540-44985-X_24

K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita, Stable Marriage with Incomplete Lists and Ties, Proceedings of ICALP 99: the 26th International Colloquium on Automata, Languages and Programming, number ii, pp.443-452, 1999.
DOI : 10.1007/3-540-48523-6_41

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

K. Iwama and S. Miyazaki, A Survey of the Stable Marriage Problem and Its Variants, International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008), pp.131-136, 2008.
DOI : 10.1109/ICKS.2008.7

F. Klijn and J. Masso, Weak stability and a bargaining set for the marriage model, Games and Economic Behavior, vol.42, issue.1, pp.91-100, 2003.
DOI : 10.1016/S0899-8256(02)00534-1

A. Kwanashie and D. Manlove, An Integer Programming Approach to the Hospital/Residents Problem with Ties. CoRR, abs/1308, pp.1-10, 2013.

D. Manlove, R. Irving, K. Iwama, S. Miyazaki, and Y. Morita, Hard variants of stable marriage, Theoretical Computer Science, vol.276, issue.1-2, pp.261-279, 2002.
DOI : 10.1016/S0304-3975(01)00206-7

E. Mcdermid, A 3/2-Approximation Algorithm for General Stable Marriage, International Colloquium on Automata, Languages and Programming, pp.689-700, 2009.
DOI : 10.1007/978-3-642-02927-1_57

D. Munera, D. Diaz, S. Abreu, F. Rossi, V. Saraswat et al., Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization, AAAI, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01144214

A. Podhradsky, Stable Marriage Problem Algorithms, 2010.

A. Roth and O. Sotomayor, Two Sided Matching: A Study in Game-Theoretic Modeling and Analysis, p.18, 1990.
DOI : 10.1017/CCOL052139015X