Dating strategies are not obvious, 2015. ,
, , 2016.
Elicitation and approximately stable matching with partial preferences, Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI '13, pp.97-105, 2013. ,
Finding robust solutions to stable marriage, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, pp.631-637, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01689897
Finding robust solutions to stable marriage, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01689897
Complexity study for the robust stable marriage problem, Theoretical Computer Science, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01974431
The Stable Marriage Problem: Structure and Algorithms, 1989. ,
Robust solutions for constraint satisfaction and optimisation under uncertainty, 2007. ,
Super solutions for combinatorial auctions, Recent Advances in Constraints, Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, pp.187-200, 2004. ,
An efficient algorithm for the "stable roommates" problem, J. Algorithms, vol.6, issue.4, pp.577-595, 1985. ,
The complexity of counting stable marriages, SIAM J. Comput, vol.15, issue.3, pp.655-667, 1986. ,
Perturbation robust stable matching. CoRR, 2016. ,
Genetic local search in combinatorial optimization, Discrete Applied Mathematics, vol.48, issue.3, pp.273-284, 1994. ,
On using matching theory to understand p2p network design, INOC 2007, International Network Optimization Conference, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00121604
On fault tolerance and robustness in autonomous systems, 2004. ,
The" stable roommates" problem with random preferences. The Annals of Probability, pp.1441-1477, 1993. ,
Rotation-based formulation for stable matching, Proceedings of CP'17, pp.262-277, 2017. ,
Genetic local search algorithms for the traveling salesman problem, Parallel Problem Solving from Nature, pp.109-116, 1991. ,