Talk:Stable matching problem: Difference between revisions

Content deleted Content added
Choices of methaphorical gender
Line 1:
== Clarification request ==
The opening sentence seems to contradict the restatement of problem in the second paragraph:
 
a stable matching — a matching in which no element of the first matched set prefers an element of the second matched set that also prefers the first element...
 
Given n men and n women, where each person has ranked all members of the opposite sex with a unique number between 1 and n in order of preference, marry the men and women off such that there are no two people of opposite sex who would both rather have each other than their current partners. If there are no such people, all the marriages are "stable".
 
The first sentence says a stable matching is one where no a in E1 prefers a b in E2 such that b also prefers a. It should be "that b also prefers an a' in E1 such that a != a'.
 
"At the end, it is not possible for a man and a woman (call them Alice and Bob) to both prefer each other to their current partners."