Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains (Q6565042)
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: Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains |
scientific article; zbMATH DE number 7874122
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains |
scientific article; zbMATH DE number 7874122 |
Statements
Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains (English)
0 references
1 July 2024
0 references
stable matchings
0 references
many-to-many matching
0 references
lexicographic preferences
0 references
core
0 references
computation complexity
0 references
0 references
