School Choice with Transferable Students Characteristics
We consider school choice problems where school priorities depend on transfer-able student characteristics. In this framework, the tradeoff between efficiency and stability can be alleviated by forming fair Pareto improvements where a group of students may improve their assignment to schools by exch...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2020 |
| País: | España |
| Institución: | Universidad Complutense de Madrid (UCM) |
| Repositorio: | Docta Complutense |
| Idioma: | inglés |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/11855 |
| Acceso en línea: | https://hdl.handle.net/20.500.14352/11855 |
| Access Level: | acceso abierto |
| Palabra clave: | C78 D61 D78 I20 School Choice Transferable Characteristics Priorities Constrained Efficiency. Econometría (Economía) 5302 Econometría |
| Sumario: | We consider school choice problems where school priorities depend on transfer-able student characteristics. In this framework, the tradeoff between efficiency and stability can be alleviated by forming fair Pareto improvements where a group of students may improve their assignment to schools by exchanging their positions and transferable characteristics at the schools they are initially assigned to without generating justified envy for the remaining students. We define the student exchange with transferable characteristics (SETC) class of algorithms. Every algorithm in the SETC class starts from an initial matching of students to schools and an initial allocation of transferable characteristics and proposes a sequence of fair Pareto improvements, until the point at which an additional efficiency gain implies a violation of the school priorities that cannot be solved with a reallocation of transferable characteristics. |
|---|