Efficient and Strategy-proof Mechanism under General Constraints
Kenzo Imamura, Yasushi Kawase · 2024
We study indivisible goods allocation problems, including real-life applications such as student placement in public schools, refugee resettlement, and student-project assignment. Such applications are often subject to constraints. This study aims to identify the constraints under which a desirable mechanism can be designed. Regarding the desirable properties of the mechanisms, we focus on Pareto efficiency for students (PE), individual rationality (IR), and group strategy-proofness (GSP). We consider two scenarios: one with and one without endowments. The applicability of either scenario in real-life applications depends on the specific circumstances.