This June-2024 Challenge deals with the famous stable marriage problem formulated as follows:
“Given n men and n women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. When there are no such pairs of people, the set of marriages is deemed stable.”
A very good analysis of the problem is provided in the recent presentation given by Dr. Guido Tack. My solution is based on OpenRules Rule Solver. It includes two different implementation approaches described in this document. The complete decision model has been added to RuleSolver samples.
Continue reading →