School choice: Nash implementation of stable matchings through rank-priority mechanisms
From MaRDI portal
Publication:2051001
Recommendations
Cites work
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- College Admissions and the Stability of Marriage
- Constrained school choice
- Implementation of stable solutions to marriage problems
- Manipulation via capacities in two-sided matching markets
- On Representatives of Subsets
- On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm
- The ``Boston school-choice mechanism: an axiomatic approach
- The modified Boston mechanism
- Truncation strategies in matching markets
- What you don't know can help you in school assignment
Cited in
(8)- Gaming the deferred acceptance when message spaces are restricted
- Acyclic priority profiles in school choice: characterizations
- Nash implementation on the basis of general priorities
- Strategy-proof school choice mechanisms with minimum quotas and initial endowments
- Stable matchings of teachers to schools
- A combinatorial auction improves school meals in Chile: a case of OR in developing countries
- School choice with asymmetric information: priority design and the curse of acceptance
- Top trading cycles with reordering: improving match priority in school choice
This page was built for publication: School choice: Nash implementation of stable matchings through rank-priority mechanisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051001)