Use this tag for algorithms which solve the stable marriage problem from graph theory.
Use this tag for algorithms which solve the stable marriage problem from graph theory.
Questions tagged [stable-marriage]
32 questions
0
votes
0 answers
Stable Marriage Problem but with numerical ratings for each other person instead of a ranking
Basically I have a group of people who rate each other from 1-10. I want to find the best way to get them into groups of 5, or preferably be able to change the group size easily.
My main issue with my previous attempts has been efficiency, as there…
Artemis
- 13
- 3
0
votes
0 answers
Many-to-Many Assignment Problem Algorithm with Constraints
I am trying to find the best algorithm for an assignment problem I am working on. Here is the situation:
There are n number of agents that are each assigned some number s of tasks, where s is the number of sessions (1-4), so each agent has exactly…
Juanita Lopez
- 3
- 2
0
votes
2 answers
stable match algorithm for different sizes groups and limited places
I want to write a program that oriented student to their specialty in university depending on their choices and their range in the specialty.
each specialty can take multiple student (in this case cnm =1 , dsi=2 , rss=2),and the number of student…
Med Salem
- 3
- 2
0
votes
2 answers
Algorithm to allocate 'skills' effectively across 'businesses' - stable marriage problem
The game Tiny Tower has various 'Bitizens' which are skilled 0-9 in different attributes:
Michael:
a) retail: 9
b) creative: 2
c) service: 7
d) recreational: 4
e) food: 6
And it then has business in which three Bitizens can work at. Each…
Josh Hunt
- 14,225
- 26
- 79
- 98
0
votes
0 answers
Rank Based Group Assignment Algorithm
I am trying to find an algorithm to assign "participants" to one of an array of groups. For each participant there are rankings of their preference for the groups. I need an algorithm to assign all of the participants to groups in the best possible…
john doe
- 5
- 4
0
votes
1 answer
Stable matching matches least preferable
I have implemented the stable matching algorithm but it seems that the implementation matches the least preferable candidates. I'm asking for a code review:
import options, sequtils
type
Person* = ref object
id: int
name:…
noconst
- 639
- 4
- 15
0
votes
1 answer
Gale-Shapley Algorithm Stability Test
I'm a beginner in python coding and am trying to figure out how to test the stability of the Gale-Shapley Algorithm. I understand that for a stable pairing to be made, this means that there's no situation whereby there's 2 people who prefers each…
Bubble
- 3
- 2
0
votes
0 answers
stable marriage alteration, searching for infinte loop with 6 people
given is the following algorithm:
we choose an initial assignment of man^woman, so that every man is engaged to exactly one woman and vice versa.
now if there's a man m that prefers a woman f' to his actual partner f, and a woman f that prefers man…
Cherry
- 81
- 2
- 10
0
votes
1 answer
Stable Matching Algorithm
I was reading up on the stable marriage problem and chanced upon this question: Is it possible that a man1 has woman1 on the top of his preference list, and woman1 has man1 on top of hers, but still there exists a stable matching (not necessarily…
Anannya Uberoi
- 53
- 1
- 4
0
votes
1 answer
Stable Matching Problem
I am currently reading an Algorithm's book and came across the Stable Matching Problem. And a question came to mind that I'm curious about, but the book doesn't answer.
In every SMP is it possible to always have one pair where each prefers the other…
user299648
- 2,769
- 6
- 34
- 43
0
votes
3 answers
Biblical Speeddating (Matching/Scheduling/Optimization)
Imagine it's 3000 BCE and we're setting up some heteronormative, polygamous speeddating.
There are n_c men and n_s women (n_s > n_c).
The speeddating will proceed in n_r rounds.
In each round, each of the men will meet with a woman.
So n_r*n_c slots…
dreeves
- 26,430
- 45
- 154
- 229
0
votes
0 answers
My method isn't putting names into my array and removing them properly
I've been working on the "Stable Marriage Problem" for a class I'm in and I cannot get it to implement the Gale-Shapely Algorithm correctly. The out put when prompted:
for (int q = 0; q < numMen; q++ )
System.out.println(couples[q].toString());
is…
DeLoreanMan121
- 1
- 1
0
votes
1 answer
How can I implement the Gale-Shapley stable marriage algorithm in Perl?
Problem statement:
We have equal number of men and women. Each man has a preference score toward each woman. So do the woman for each man. Each of the men and women have certain interests. Based on the interest, we calculate the preference…
ksskr
- 238
- 4
- 15
0
votes
1 answer
Stable marriage (SMP) where graph is incomplete
To my understanding SMP will always have a stable solution as long as the graph is complete. In other words every male may are able to marry every female and vice versa.
But what if this does not hold true? Lets say that some males have a list of…
Chippen
- 349
- 2
- 9
0
votes
0 answers
Stable Marriage algorithm java code
I need to implement makeMatches method in stable marriage class.
Code needs to follow this algorithm:
set each person to be free;
while (some man m with a nonempty preference list is free) {
w = first woman on m's list;
if (some man p is…
user2892573
- 1
- 1
- 1