Matching with quorums
From MaRDI portal
Publication:2440142
Recommendations
Cites work
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Serial dictatorship and Pareto optimality
- Strategy-proof allocation of indivisible goods
- Strategy-proof, efficient, and nonbossy quota allocations
- The Hospitals/Residents Problem with Quota Lower Bounds
- The college admissions problem with lower and common quotas
Cited in
(9)- Constrained allocation of projects to heterogeneous workers with preferences over peers
- A note on the serial dictatorship with project closures
- Strategyproof matching with regional minimum and maximum quotas
- Simplified group activity selection with group size constraints
- Pareto optimal matchings with lower quotas
- Stable matchings with covering constraints: a complete computational trichotomy
- On the terminology of economic design: a critical assessment and some proposals
- Matchings with lower quotas: algorithms and complexity
- Pareto optimal matchings of students to courses in the presence of prerequisites
This page was built for publication: Matching with quorums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440142)