Abstract
In this paper we present a max-min conflict algorithm to find a stable matching rather than the man- and woman-optimal matchings for the stable marriage problem. We solve the problem in terms of a constraint satisfaction problem, i.e. find a complete assignment for men in which every man is assigned to a woman so that the assignment does not contain any blocking pairs. To do this, we apply a local search method in which a max-conflict heuristic is used to choose the man making the maximum number of blocking pairs in a matching, while a min-conflict heuristic is used to remove all the blocking pairs formed by the chosen man. Experiments showed that our algorithm is efficient for finding a stable matching of large stable marriage problems.
Author supplied keywords
Cite
CITATION STYLE
Viet, H. H., Uyen, N. T., My, P. T., Cao, S. T., & Trang, L. H. (2019). A Max-Min Conflict Algorithm for the Stable Marriage Problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11669 LNAI, pp. 44–53). Springer Verlag. https://doi.org/10.1007/978-3-030-30639-7_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
