stable marriage problem
mathematical problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element
Press Enter · cited answer in seconds
0 sources
stable marriage problem
Summary
stable marriage problem ranks in the top 2% of general entities by monthly Wikipedia readership (170 views/month).[1]
Key Facts
- stable marriage problem's Library of Congress authority ID is recorded as sh85081518[2].
- stable marriage problem's Bibliothèque nationale de France ID is recorded as 12372391v[3].
- stable marriage problem's subclass of is recorded as stable matching problems[4].
- stable marriage problem's Freebase ID is recorded as /m/032gqp[5].
- stable marriage problem's facet of is recorded as stable matching theory[6].
- stable marriage problem's different from is recorded as stable roommates problem[7].
- stable marriage problem's FAST ID is recorded as 1010646[8].
- stable marriage problem's Microsoft Academic ID is recorded as 146393371[9].
- stable marriage problem's PlanetMath ID is recorded as StableMarriageProblem[10].
- stable marriage problem's National Library of Israel J9U ID is recorded as 987007553378805171[11].
- stable marriage problem's OpenAlex ID is recorded as C146393371[12].
- stable marriage problem's Yale LUX ID is recorded as concept/eb27c1d5-4001-4c65-8669-321f19b554c6[13].
Why It Matters
stable marriage problem ranks in the top 2% of general entities by monthly Wikipedia readership (170 views/month).[1] It has Wikipedia articles in 18 language editions, a strong signal of global cultural recognition.[14] It is known by 13 alternative names across languages and contexts.[15]