The Complexity of Finding Fair Many-to-One Matchings

Niclas Boehmer, Tomohiro Koana. The Complexity of Finding Fair Many-to-One Matchings. ACM Transactions on Algorithms, 20(2):17, April 2024. [doi]

Abstract

Abstract is missing.