![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences
We study stable matching problems where agents have multilayer preferences: There are \(\ell \) ℓ ...
-
Chapter and Conference Paper
A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas
In the Hospital Residents problem with lower and upper quotas (HR- \({Q}_{L}^{U}\) Q L U ), the goal is to find a stable matching of residents to hospitals where the number of residents matched to a hospit...
-
Chapter and Conference Paper
Multidimensional Stable Roommates with Master List
Since the early days of research in algorithms and complexity, the computation of stable matchings is a core topic. While in the classic setting the goal is to match up two agents (either from different “gende...