We study priority-based assignment problems with distributional and diversity objectives. Our work provides an axiomatic characterization of a general class choice rules which are based on type-specific reserves quotas. The in the differ by order applicants considered for units reserved different types. show that particular reserves- quotas-based rule, where all first their own types, uniquely ...

We consider a scheduling game on parallel related machines, in which jobs try to minimize their completion time by choosing machine be processed on. Each uses an individual priority list decide the order according are processed. prove that it is NP-hard if pure Nash equilibrium exists and characterize four classes of instances guaranteed exist. For each these classes, we give algorithm computes...