Stable matching problem: Difference between revisions

Content deleted Content added
m small style edit. Does anyone know whether the style manual says anything about this?
Line 1:
In [[mathematics]], the '''stable marriage problem''' ('''SMP)''') is as follows:
 
: 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, [[marriage|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".