Content deleted Content added
mNo edit summary Tag: Reverted |
Undid revision 1252069856 by MathEcon (talk) too vague; it needs to be 1-to-1 |
||
Line 1:
{{Short description|Pairing where no unchosen pair prefers each other over their choice}}
In [[mathematics]], [[economics]], and [[computer science]], the '''stable marriage problem''' (also '''stable matching problem''') is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a
{{Ordered list|list-style-type=numeric
| |||