An algorithm to compute the full set of many-to-many stable matchings. (Q1431789)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to compute the full set of many-to-many stable matchings. |
scientific article; zbMATH DE number 2073667
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to compute the full set of many-to-many stable matchings. |
scientific article; zbMATH DE number 2073667 |
Statements
An algorithm to compute the full set of many-to-many stable matchings. (English)
0 references
11 June 2004
0 references
Matching
0 references
Stability
0 references
Substitutable preferences
0 references
Algorithm
0 references
0 references
0 references
0.92094266
0 references
0.91706574
0 references
0.8945933
0 references
0.89033806
0 references
0.8863092
0 references
0.8855013
0 references
0.8839909
0 references
0.88380456
0 references
0.88380456
0 references
