Computational complexity of \(k\)-stable matchings (Q6546302)
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: Computational complexity of k-stable matchings |
scientific article; zbMATH DE number 7855689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of \(k\)-stable matchings |
scientific article; zbMATH DE number 7855689 |
Statements
Computational complexity of \(k\)-stable matchings (English)
0 references
29 May 2024
0 references
majority stability
0 references
stable matching
0 references
popular matching
0 references
complexity
0 references
0 references
0 references
0.7858298420906067
0 references
0.7820956110954285
0 references
0.7819029092788696
0 references
0.7805508971214294
0 references
0.7741762399673462
0 references
