Stable Marriage Problem Solutions
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.
You may read more about this famous stable marriage problem. Here is an example of the problem:
How Men Rank Women:
| Alice | Barbara | Claire | Doris | Elsie | |
| Adam | 5 | 1 | 2 | 4 | 3 |
| Bob | 4 | 1 | 3 | 2 | 5 |
| Charlie | 5 | 3 | 2 | 4 | 1 |
| Dave | 1 | 5 | 4 | 3 | 2 |
| Edgar | 4 | 3 | 2 | 1 | 5 |
How Women Rank Men:
| Adam | Bob | Charlie | Dave | Edgar | |
| Alice | 1 | 2 | 4 | 3 | 5 |
| Barbara | 3 | 5 | 1 | 2 | 4 |
| Claire | 5 | 4 | 2 | 1 | 3 |
| Doris | 1 | 4 | 3 | 2 | 5 |
| Elsie | 4 | 2 | 3 | 5 | 1 |
You task is to create a decision model capable to pair up a group of men and women so that the resulting marriages are stable. If you are worry about fairness of your decisions, listen to this presentation by Guido Tack.
Send your solutions to DecisionManagementCommunity@gmail.com.
Solutions:
- OPL/CPLEX – submitted by Alex Fleischer
- Prolog – submitted by Matteo Redaelli
- Pytjon – submitted by Alireza Soroudi
- OpenRules RuleSolver (with Java)– submitted by Jacob Feldman
- OpenRules RuleSolver (no Java)- submitted by Jacob Feldman
- Watsonx – submitted by Alex Fleischer
- …
Decision Management Community 
You must be logged in to post a comment.