Stable Marriage Problem with Prolog

2024-06-07

stable marriage problem My #prolog solution for Stable Marriage Problem proposed by dmcommunity.org challenge Jun 2024.

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.

Algorithms for finding solutions to the stable marriage problem have applications in a variety of real-world situations, perhaps the best known of these being in the assignment of graduating medical students to their first hospital appointments

?- findall(M, (sol(S), marriages(S, M)), L), maplist(writeln, L).
[Adam-Claire,Bob-Barbara,Charlie-Alice,Dave-Elsie,Edgar-Doris]
[Adam-Claire,Bob-Doris,Charlie-Alice,Dave-Elsie,Edgar-Barbara]
[Adam-Doris,Bob-Elsie,Charlie-Alice,Dave-Claire,Edgar-Barbara]
[Adam-Elsie,Bob-Claire,Charlie-Alice,Dave-Doris,Edgar-Barbara]
[Adam-Elsie,Bob-Claire,Charlie-Doris,Dave-Barbara,Edgar-Alice]

Below the code

:-use_module(library(clpfd)).

dim(5).

husbands_ranks([[5,1,2,4,3],
		[4,1,3,2,5],
		[5,3,2,4,1],
		[1,5,4,3,2],
		[4,3,2,1,5]
	       ]).

wifes_ranks([[5,1,2,4,3],
	     [4,1,3,2,5],
	     [5,3,2,4,1],
	     [1,5,4,3,2],
	     [4,3,2,1,5]
	    ]).

rank(Person1, Person2, Ranks, Rank):-
    nth1(Person1, Ranks, PersonRanks),
    nth1(Person2, PersonRanks, Rank).

/*
Wifes is a list of integer
First element is the wife of men 1
Second element is the wife of men 2
...
*/
sol(Wifes):-
    dim(N),
    husbands_ranks(HusbandRanks),
    wifes_ranks(WifeRanks),
    %% Wifes is a list of N elements
    length(Wifes, N),
    %% Each element is a wige (1=Alice)
    Wifes ins 1..N,
    all_distinct(Wifes),
    label(Wifes),
    stable_marriages(Wifes, HusbandRanks, WifeRanks).

instable_marriages(Wifes, HusbandRanks, WifeRanks, [Husband1-Wife1, Husband2-Wife2]):-
    %% Husband1 is the index of an element of the list
    %% Wife1 is a element of teh list of 
    nth1(Husband1, Wifes, Wife1),
    rank(Husband1, Wife1, HusbandRanks, MRank11),
    nth1(Husband2, Wifes, Wife2),
    Husband1 #\= Husband2,
    Wife1 #\= Wife2,
    rank(Wife2, Husband2, WifeRanks, FRank22),
    rank(Husband1, Wife2, HusbandRanks, MRank12),   
    rank(Wife2, Husband1, WifeRanks, FRank21),
    MRank12 #> MRank11,
    FRank21 #> FRank22.

stable_marriages(Wifes, HusbandsRanks, WifesRanks):-
    instable_marriages(Wifes, HusbandsRanks, WifesRanks, _) -> false ; true.

%% needed to convert numbers to first names

husbands_names(['Adam','Bob','Charlie','Dave','Edgar']).
wifes_names(['Alice','Barbara','Claire','Doris','Elsie']).

wife_index_name(Index, Name):-
    wifes_names(WifesNames),
    nth1(Index, WifesNames, Name).

wifes_index_name([], []).
wifes_index_name([Index|Indexes], [Name|Names]):-
    wife_index_name(Index, Name),
    wifes_index_name(Indexes, Names).
    
marriages(Wifes, Marriagies):-
    husbands_names(HusbandsNames), 
    wifes_index_name(Wifes, WifesNames),
    pairs_keys_values(Marriagies, HusbandsNames, WifesNames).

Enter your instance's address


More posts like this

Smart investment Problem with Prolog

2024-07-14 | #programming #prolog

Below my #prolog solution for Smart investment problem. It is a sample of Linear Programming using Prolog. A client of an investment firm has $10000 available for investment. He has instructed that his money be invested in particular stocks, so that no more than $5000 is invested in any one stock but at least $1000 be invested in each stock.

Continue reading 