Latin Rectangles and Stable Matchings in Many-Sided Problems
Operations Research and Decisions · 2026
DOI: 10.37190/ord/236718 ↗Kurz gefasst
Fachartikel in der Zeitschrift Operations Research and Decisions, 2026. Verfasst von Marcin Anholcer.
Abstract (Originalsprache)
In 1962, Gale and Shapley proved that there exists a stable matching in every instance of the 2-Sided Stable Matching Problem. It was shown very quickly that it does not have to be true in the case of 3-Sided Stable Matching Problems (or more generally, Many-Sided Stable Matching Problems). A natural question was posed: What system of preferences guarantees stable matching in many-sided problems? We give a partial answer to this question, using Latin rectangles.
Zitieren
APA
Anholcer, M. (2026). Latin Rectangles and Stable Matchings in Many-Sided Problems. Operations Research and Decisions. https://doi.org/10.37190/ord/236718
Vancouver
Anholcer M. Latin Rectangles and Stable Matchings in Many-Sided Problems. Operations Research and Decisions. 2026. doi:10.37190/ord/236718
BibTeX
@article{Anholcer2026,
author = {Anholcer, Marcin},
title = {Latin Rectangles and Stable Matchings in Many-Sided Problems},
journal = {Operations Research and Decisions},
year = {2026},
doi = {10.37190/ord/236718}
}
EUVIMED