Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains

We study strong core and Pareto-optimal solutions for multiple partners matching problem under lexicographic preference domains from a computational point of view. The restriction to the two-sided case is called stable many-to-many matching problem and the general one-sided case is called stable fix...

Celý popis

Podrobná bibliografia

Vydané v:	Games and economic behavior Ročník 145; s. 217 - 238
Hlavní autori:	Biró, Péter, Csáji, Gergely
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.05.2024
Predmet:	Computation complexity Core Lexicographic preferences Many-to-many matching Stable matchings Computation complexity Lexicographic preferences Many-to-many matching Stable matchings Core
ISSN:	0899-8256, 1090-2473
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!