In this paper, we consider the problem of assigning agents having preferences to projects with capacities and lower quotas. For this problem, Monte and Tumennasan proposed a strategy-proof and Pareto efficient mechanism, called the serial dictatorship with project closures. In this paper, we show that the serial dictatorship with project closures can be extended to a more general setting.
All Science Journal Classification (ASJC) codes
- 経営科学およびオペレーションズ リサーチ