Titlebook: ;

巫婆

https://doi.org/10.1007/978-1-4615-8532-9ent this with an .-hardness result when classes are non-laminar even under strict preference lists, and even when only posts have classifications, and each applicant has a quota of one. We show an analogous dichotomy result for computing a popular matching amongst feasible matchings (if one exists)