scispace - formally typeset
Open AccessJournal ArticleDOI

A dynamic school choice model

Reads0
Chats0
TLDR
It is proved that a solution always exists and that it can be reached by a modified version of the deferred acceptance algorithm of Gale and Shapley, and that the mechanism is dynamically strategy-proof and respects improvements whenever the set of orders is lexicographic by tenure.
About
This article is published in Games and Economic Behavior.The article was published on 2013-07-01 and is currently open access. It has received 48 citations till now. The article focuses on the topics: Solution concept & Assignment problem.

read more

Citations
More filters
Posted Content

Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions

TL;DR: The deferred acceptance algorithm proposed by Gale and Shapley (1962) has had a profound influence on market design, both directly, by being adapted into practical matching mechanisms, and indirectly, by raising new theoretical questions.
Journal ArticleDOI

House Allocation with Overlapping Generations

TL;DR: In this paper, the authors introduce a model of house allocation with overlapping generations and examine two static rules of serial dictatorship and top trading cycles in terms of their dynamic Pareto efficiency and incentive compatibility.
Journal ArticleDOI

The Day Care Assignment: A Dynamic Matching Problem

TL;DR: In this article, the authors study the problem of centralized allocation of children to public day care centers, illustrated by the case of Denmark, and show that there does not exist any mechanism that is both stable and strategy-proof.
Journal ArticleDOI

The Local Refugee Match: Aligning Refugees’ Preferences with the Capacities and Priorities of Localities

TL;DR: This article proposed a two-sided matching system to match refugees with localities, based on the success of matching in domains such as public school choice, and illustrate in general terms how they could be applied to refugee protection.

The Design of Teacher Assignment: Theory and Evidence

TL;DR: In this article, the authors identify the class of mechanisms which cannot be improved upon in terms of eciency and fairness for two-sided and one-sided eciencies.
References
More filters
Journal ArticleDOI

College Admissions and the Stability of Marriage

TL;DR: In this article, the authors studied the relationship between college admission and the stability of marriage in the United States, and found that college admission is correlated with the number of stable marriages.
Book

Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis

TL;DR: The marriage model and the labor market for medical interns, a simple model of one seller and many buyers, and Discrete models with money, and more complex preferences are examined.
Journal ArticleDOI

School Choice: A Mechanism Design Approach

TL;DR: In this article, the authors formulate the school choice problem as a mechanism design problem and analyze some of the existing school choice plans including those in Boston, Columbus, Minneapolis, and Seattle, and offer two alternative mechanisms each of which may provide a practical solution to some critical school choice issues.
Journal ArticleDOI

The Economics of Matching: Stability and Incentives

TL;DR: The main focus of this paper is on determining the extent to which matching procedures can be designed which give agents the incentive to honestly reveal their preferences, and which produce stable matches.
Journal ArticleDOI

Machiavelli and the Gale-Shapley Algorithm

TL;DR: The object here is to prove that the algorithm for assigning students to universities gives each student the best university available in a stable system of assignments.
Frequently Asked Questions (9)
Q1. What are the contributions in "Division of the humanities and social sciences" ?

This paper considers a real-life assignment problem faced by the Mexican Ministry of Public Education. Inspired by this situation, the authors introduce a dynamic school choice problem that consists in assigning positions to overlapping generations of teachers. In this framework, a solution concept that conciliates the fairness criteria with the individual rationality condition is introduced. The authors also show that the mechanism is dynamic strategy-proof, and respects improvements whenever the set of orders is lexicographic by tenure. 

The author also studies two dynamic mechanisms: a spot mechanism (with or without property right transfers) and a future mechanism. 

The authors prove that if each school’s priority ranking is lexicographic by tenure, that is, if teachers who were present in the previous period have priority over new teachers, then the proposed mechanism is dynamic strategy-proof. 

In an overlapping teacher placement problem 〈 S, {qs}s , The authort, µt−1, , >t 〉 in which the set of orders >t= {>ts}s∈S is lexicographic by tenure, each order in the related market consists of three groups of teachers. 

the problem of finding an acceptable matching in their original framework is equivalent to finding a matching that adapts to Ot and is non-wasteful in the related market. 

In this paper, the authors have developed a new framework to model a dynamic school choice problem with overlapping generations of agents. 

Then the matching generated in each period is:µ′t = i j k s1 s3 s2 µ′t+1 = i j l s2 s3 s1 Since µ′t+1(i) = s2 i µt+1(i) = s1, teacher i can benefit by unilaterally misrepresenting her preferences. 

The author introduces a model of house allocation with overlapping agents and analyzes the impact of orderings on Pareto efficiency and strategy-proofness. 

In their problem, under the assumption that in each period there are at least three teachers, each of whom was assigned to a different school in the previous period, the priority structure of the related market