Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720)
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 5171342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time algorithm for an optimal stable assignment with multiple partners |
scientific article; zbMATH DE number 5171342 |
Statements
Polynomial time algorithm for an optimal stable assignment with multiple partners (English)
0 references
16 July 2007
0 references
stable marriage
0 references
multiple partners
0 references
optimal assignment
0 references
substitutes
0 references
dis-satisfaction score
0 references
meta-rotation
0 references
0 references
0.8955782
0 references
0.8955782
0 references
0 references
0 references
0.8860179
0 references
0.8806183
0 references
0 references
0.87773037
0 references
0 references
0.87422043
0 references
