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...

Full description

Bibliographic Details

Published in:	Games and economic behavior Vol. 145; pp. 217 - 238
Main Authors:	Biró, Péter, Csáji, Gergely
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2024
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!