Two problems in max-size popular matchings (Q2415362)
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: Two problems in max-size popular matchings |
scientific article; zbMATH DE number 7057337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two problems in max-size popular matchings |
scientific article; zbMATH DE number 7057337 |
Statements
Two problems in max-size popular matchings (English)
0 references
21 May 2019
0 references
matchings under preferences
0 references
Gale-Shapley algorithm
0 references
linear programming duality
0 references
NP-hardness
0 references
0.937743365764618
0 references
0.8999613523483276
0 references
0.8970622420310974
0 references
0.8960272669792175
0 references
0.895079493522644
0 references
