Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang
{"title":"A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists","authors":"Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang","doi":"10.1007/s10732-020-09464-8","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we propose a heuristic search algorithm based on maximum conflicts to find a weakly stable matching of maximum size for the stable marriage problem with ties and incomplete lists. The key idea of our approach is to define a heuristic function based on the information extracted from undominated blocking pairs from the men’s point of view. By choosing a man corresponding to the maximum value of the heuristic function, we aim to not only remove all the blocking pairs formed by the man but also reject as many blocking pairs as possible for an unstable matching from the women’s point of view to obtain a solution of the problem as quickly as possible. Experiments show that our algorithm is efficient in terms of both execution time and solution quality for solving the problem.\n</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":1.1000,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Heuristics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10732-020-09464-8","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, we propose a heuristic search algorithm based on maximum conflicts to find a weakly stable matching of maximum size for the stable marriage problem with ties and incomplete lists. The key idea of our approach is to define a heuristic function based on the information extracted from undominated blocking pairs from the men’s point of view. By choosing a man corresponding to the maximum value of the heuristic function, we aim to not only remove all the blocking pairs formed by the man but also reject as many blocking pairs as possible for an unstable matching from the women’s point of view to obtain a solution of the problem as quickly as possible. Experiments show that our algorithm is efficient in terms of both execution time and solution quality for solving the problem.
期刊介绍：
The Journal of Heuristics provides a forum for advancing the state-of-the-art in the theory and practical application of techniques for solving problems approximately that cannot be solved exactly. It fosters the development, understanding, and practical use of heuristic solution techniques for solving business, engineering, and societal problems. It considers the importance of theoretical, empirical, and experimental work related to the development of heuristics.
The journal presents practical applications, theoretical developments, decision analysis models that consider issues of rational decision making with limited information, artificial intelligence-based heuristics applied to a wide variety of problems, learning paradigms, and computational experimentation.
Officially cited as: J Heuristics
Provides a forum for advancing the state-of-the-art in the theory and practical application of techniques for solving problems approximately that cannot be solved exactly.
Fosters the development, understanding, and practical use of heuristic solution techniques for solving business, engineering, and societal problems.
Considers the importance of theoretical, empirical, and experimental work related to the development of heuristics.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
