Worst-case choice for the stable marriage problem (Q1063004)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3916316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case choice for the stable marriage problem |
scientific article; zbMATH DE number 3916316 |
Statements
Worst-case choice for the stable marriage problem (English)
0 references
1985
0 references
We present a worst-case choice for the stable marriage problem which takes the maximum number of stages for \textit{D. Gale} and \textit{L. S. Shapely}'s algorithm [Amer. Math. Monthly 69, 9-15 (1962; Zbl 0109.244)]. We also analyze a coroutine solution recently suggested by \textit{L. Allison} [Inf. Process. Lett. 16, 61-65 (1983; Zbl 0513.68064)] as well as a parallel algorithm for this problem.
0 references
worst-case choice
0 references
stable marriage problem
0 references
parallel algorithm
0 references
0.8796975016593933
0 references
0.8417736291885376
0 references
0.8308749198913574
0 references
0.8307075500488281
0 references
0.8276357054710388
0 references
