Content deleted Content added
m Reverted edit by 999-Bandera Mouse (talk) to last version by David Eppstein |
Sharkmelden (talk | contribs) m Unlinked the word matching from the page Matching (graph theory) because the word matching in this instance does not refer to independent edge set, but rather a bijection from the elements of one set to another. |
||
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
{{Ordered list|list-style-type=numeric
| |||