Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
Hardness of Instance Generation with Optimal Solutions for the Stable Marriage Problem
Yuki MatsuyamaShuichi Miyazaki
Author information

2021 Volume 29 Pages 166-173


In a variant of the stable marriage problem where ties and incomplete lists are allowed, finding a stable matching of maximum cardinality is known to be NP-hard. There are a lot of experimental studies for evaluating the performance of approximation algorithms or heuristics, using randomly generated or artificial instances. One of standard evaluation methods is to compare an algorithm's solution with an optimal solution, but finding an optimal solution itself is already hard. In this paper, we investigate the possibility of generating instances with known optimal solutions. We propose three instance generators based on a known random generation algorithm, but unfortunately show that none of them meet our requirements, implying a difficulty of instance generation in this approach.

Content from these authors
© 2021 by the Information Processing Society of Japan
Previous article Next article