Constrained School Choice



the empty list. Let Q := (Qi, Q-i). By a result of Gale and Sotomayor (1985b, Theorem
2) extended to the college admissions model (Roth and Sotomayor, 1990, Theorem 5.34),
for each
j I\i, either γ(Q)(j) = γ(Q)(j) or γ(Q^)(j)QjY(Q)(j). Hence, the set of
schools to which each
j ∈ I\i proposes in DA(Q) is a subset of the schools to which
he proposes in
DA(Q). Since moreover Qi is the empty list, each school receives in
DA(Q) only a subset of the proposals of DA(Q). For school s this immediately implies
that
∣γ(dQ)(s)∣ ≤ ∣γ(Q)(s)∣ < qs. So, if we take Qi = s then γ(Qi,Q-i)(i) = s. Since
sPiγ(Q)(i), Qi is a profitable deviation for i at Q in Γγ(P, k). So, Q ∈ Eγ(P, k), a
contradiction. Hence,
γ(Q) ∈ NW(P).                                            

Proof of Theorem 5.3 It suffices to prove the theorem for k = k+ 1. Let Q ∈ Eγ(P, k)
and suppose that
Q ∈ Eγ(P, k +1). Then, there is a student i and a strategy Qi ∈ Q(k + 1)
with
γ(Qi,Q-i)Piγ(Qi,Q-i). By Lemma A.2, γ(Q) ∈ IR(P). Hence, γ(Qi,Q-i)(i) ∈ S.
Note also that
Qi must be a list containing exactly k + 1 schools, for otherwise it would
also be a profitable deviation in Γ
γ(P, k), contradicting Q ∈ Eγ(P, k).

Let s be the last school listed in Q'i. We claim that γ(Qi,Q-i)(i) = s. Suppose
Y(Qi,Q-i)(i) = s. Consider the truncation of Qi after γ(Qi,Q-i)(i) and denote this list
by
Qi. In other words, Qiis the list obtained from Qi by making all schools listed after
Y (Qi, Q-i)(i) unacceptable. By assumption, Qi∈ Q(k). It follows from the DA algorithm
that
Y(Qi, Q-i) = Y(Qi, Q-i). Hence, Qi is a profitable deviation for i at Q in Γγ(P, k),
a contradiction. So,
Y(Qi, Q-i)(i) = s.

Let Qi := s. Note Qi Q(k). By Lemma A.1, γ((Qi,Q-i)(i') = s. Hence, Qi is a
profitable deviation for
i at Q in Γγ(P, k), a contradiction. Hence, Q ∈ Eγ(P, k + 1).

We need the following three lemmas to prove Theorem 6.5.

Lemma A.3 Let f be an Ergin-cyclic priority structure. Let 2 ≤ k ≤ m. Then, there
is a school choice problem
P with an unstable equilibrium outcome in the game Γγ (P, k),
i.e., for some
Q ∈ Eγ(P,k), Y(Q) ∈ S(P).

Proof Since f is Ergin-cyclic, we may assume, without loss of generality, that

(a) fs1(i1) < fs1 (i2) < fs1(i3) and fs2(i3) < fs2(i1),

(b) fs1 (ij) < fs1 (i2) for each j ∈ I1 := {4, . . . , qs1 + 2}, and

(c) fs2 (ij) < fs2 (i1) for each j ∈ I2 := {qs1 + 3, . . . , qs1 + qs2 + 1}.

Consider students’ preferences P defined by Pi1 := s2, s1 , Pi2 := s1 , Pi3 := s1, s2,

Pij := si for j ∈ Iι, Pij := s2 for j ∈ I2, and Pij := 0 for all j ∈ {q31 + qβ2 + 2,..., n}.

29



More intriguing information

1. Should Local Public Employment Services be Merged with the Local Social Benefit Administrations?
2. The name is absent
3. Equity Markets and Economic Development: What Do We Know
4. Are Public Investment Efficient in Creating Capital Stocks in Developing Countries?
5. The effect of globalisation on industrial districts in Italy: evidence from the footwear sector
6. If our brains were simple, we would be too simple to understand them.
7. The name is absent
8. Three Strikes and You.re Out: Reply to Cooper and Willis
9. he Virtual Playground: an Educational Virtual Reality Environment for Evaluating Interactivity and Conceptual Learning
10. Solidaristic Wage Bargaining