Group robust stability in matching markets, Games and Economic Behavior, vol.74, issue.1, pp.394-398, 2012. ,
Stable matching with uncertain linear preferences, 2016. ,
Robustness, stability, recoverability, and reliability in constraint satisfaction problems, Knowl. Inf. Syst, vol.44, issue.3, pp.719-734, 2015. ,
Worst-case upper bounds, Handbook of Satisfiability, pp.403-424, 2009. ,
Elicitation and approximately stable matching with partial preferences, Proceedings of the TwentyThird International Joint Conference on Artificial Intelligence. IJCAI '13, pp.97-105, 2013. ,
College admissions and the stability of marriage, The American Mathematical Monthly, vol.69, issue.1, pp.9-15, 1962. ,
Finding robust solutions to stable marriage, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. IJCAI '17, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01689897
On the complexity of robust stable marriage, Combinatorial Optimization and Applications-11th International Conference, pp.441-448, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01689884
Robust stable marriage, Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp.4925-4926, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01689852
Supermodels and robustness, AAAI/IAAI, pp.334-339, 1998. ,
Every finite distributive lattice is a set of stable matchings for a small stable marriage instance, Journal of Combinatorial Theory, Series A, vol.44, issue.2, pp.304-309, 1987. ,
The Stable Marriage Problem: Structure and Algorithms, 1989. ,
Robust solutions for constraint satisfaction and optimisation under uncertainty, 2007. ,
Robust solutions for constraint satisfaction and optimization, Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004, including Prestigious Applicants of Intelligent Systems, pp.186-190, 2004. ,
Super solutions in constraint programming, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, First International Conference, pp.157-172, 2004. ,
DOI : 10.1007/978-3-540-24664-0_11
The complexity of counting stable marriages, SIAM J. Comput, vol.15, issue.3, pp.655-667, 1986. ,
Perturbation robust stable matching, 2016. ,
Robust stability in matching markets, Theoretical Economics, vol.6, issue.2, pp.257-267, 2011. ,
DOI : 10.3982/te780
URL : https://onlinelibrary.wiley.com/doi/pdf/10.3982/TE780
Finding stable matchings that are robust to errors in the input, 2018. ,
Algorithmics Of Matching Under Preferences. Theoretical computer science, 2013. ,
DOI : 10.1142/8591
Robust and approximately stable marriages under partial information, 2018. ,
DOI : 10.1007/978-3-030-04612-5_23
URL : http://arxiv.org/pdf/1804.09156
Robustness for a single railway line: Analytical and simulation methods, Expert Syst. Appl, vol.39, issue.18, pp.13305-13327, 2012. ,
DOI : 10.1016/j.eswa.2012.05.071
The complexity of satisfiability problems, Proceedings of the Tenth Annual ACM Symposium on Theory of Computing. STOC '78, pp.216-226, 1978. ,
Convex programming with set-inclusive constraints and applications to inexact linear programming, Operations Research, vol.21, issue.5, pp.1154-1157, 1973. ,
DOI : 10.1287/opre.21.5.1154
Some varieties of robustness, Journal of Economic Methodology, vol.13, issue.2, pp.219-240, 2006. ,
DOI : 10.1080/13501780600733376
Robustness and regularization of support vector machines, J. Mach. Learn. Res, vol.10, pp.1485-1510, 2009. ,
Srccp: A stochastic robust chance-constrained programming model for municipal solid waste management under uncertainty. Resources, Conservation and Recycling, vol.53, pp.352-363, 2009. ,
DOI : 10.1016/j.resconrec.2009.02.002