School choice procedures: How do they matter? Theory and evidence from Belgium Estelle Cantillon Nicolas Gothelf Université Libre de Bruxelles June 2009.

Slides:



Advertisements
Similar presentations
Life sentence in Finland and other Nordic Countries
Advertisements

Chapter 5: CPU Scheduling
N. Basilico, N. Gatti, F. Amigoni DEI, Politecnico di Milano Leader-Follower Strategies for Robotic Patrolling in Environments with Arbitrary Topology.
1 Alternative measures of well-being Joint work by ECO/ELSA/STD.
OECD Thematic Review on Migrant Education: Progress Reporting The OECD Migrant Education Review Team 13 October nd Meeting of the Group of National.
L3S Research Center University of Hanover Germany
Statistics for Improving the Efficiency of Public Administration Daniel Peña Universidad Carlos III Madrid, Spain NTTS 2009 Brussels.
How to do intraday capacity pricing in a continuous trade environment? 10 October 2011 NRA-TSO-PX meeting (Informal minutes, made during workshop, of the.
ATFM Priorities Evaluation Study Alison Hudgell QinetiQ
On-the-job Evaluation of Principals Jacquelyn O. Wilson, Ed.D. Delaware SAELP Director Wallace Foundation National Conference October 25-28, 2006.
1 Mid-Term Review of The Illinois Commitment Assessment of Achievements, Challenges, and Stakeholder Opinions Illinois Board of Higher Education April.
1 IMPROVING TRANSPORTATION SERVICES IN EARLY EDUCATION AND CARE SETTINGS EEC Board Meeting – November 8, 2011.
The Grade 9 Cohort of Fall 2000: Post-secondary Pathways Preliminary Analysis Presentation to HEQCO - June 15, 2009 Dr. Robert S. Brown Organizational.
Connecting Classrooms to Systems of School-wide PBS
Phase II/III Design: Case Study
The World Bank Human Development Network Spanish Impact Evaluation Fund.
Project Delivery Approaches for Wastewater Utilities in Minnesota June 24, 2008 Metropolitan Council Environment Committee.
Jose-Luis Blanco, Javier González, Juan-Antonio Fernández-Madrigal University of Málaga (Spain) Dpt. of System Engineering and Automation May Pasadena,
School Choice 1. Today’s Class So far, have discussed different approaches to solving non-monetary allocation problems. Finding stable outcomes: DA algorithm.
Cory Koedel, Eric Parsons, Michael Podgursky and Mark Ehlert
A Comparative Theory of Legislation, Discretion, and Policy making Process (Huber&Shipan) Two crucial elements in the politicians- bureaucrats interaction.
Matching Theory.
Subject Selection and Assent in Pediatric Research.
Dr. Carol Clarke Research Staff Officer USDA-APHIS Animal Care
Good Evaluation Planning – and why this matters Presentation by Elliot Stern to Evaluation Network Meeting January 16 th 2015.
MARKETS IN EDUCATION EFFECTS, IMPACT AND DIVERSITY Alexandre Homem Cristo ECNAIS, Warsaw, November 18th 2011.
An Experimental Test of House Matching Algorithms Onur Kesten Carnegie Mellon University Pablo Guillen University of Sydney.
Scheduling in Batch Systems
What we will cover…  CPU Scheduling  Basic Concepts  Scheduling Criteria  Scheduling Algorithms  Evaluations 1-1 Lecture 4.
Preference Analysis Joachim Giesen and Eva Schuberth May 24, 2006.
Warehouse operator selection by combining AHP and DEA methodologies
Health Systems and the Cycle of Health System Reform
The Utilization of a Partnership to Provide Quality Education to a Historically Disadvantaged Primary School in the Western Cape.
Chapter 6 Global Sales Organizations Sales Management: A Global Perspective Earl D. Honeycutt John B. Ford Antonis Simintiras.

- 0 - Community Forums OUSD School Admissions and Attendance Boundary Policies Spring 2008.
IN THE NAME OF GOD Flagship Course on Health Sector Reform and Sustainable Financing; Module 4: : How to construct.
Early Childhood Development As Smart Economics: the Case of Roma Inclusion in Europe 1.
1 CSI5388: Functional Elements of Statistics for Machine Learning Part I.
Quasi Experimental Methods I Nethra Palaniswamy Development Strategy and Governance International Food Policy Research Institute.
Case Studies Harry Anthony Patrinos World Bank November 2009.
Enabling Class of Service for CIOQ Switches with Maximal Weighted Algorithms Thursday, October 08, 2015 Feng Wang Siu Hong Yuen.
JSP UNIT 3 THE BILINGUAL AND MULTILINGUAL EDUCATIONAL PROGRAMS. LEGAL FRAMEWORK. ORGANIZATIONAL AND PEDAGOGICAL MANAGEMENT DOCUMENTS.
Policy Analysis: Frameworks and Models Stokey and Zeckhauser Ch1-3 Jenkins-Smith Ch1-3 Weimer and Vining Ch1-2.
Introduction to Matching Theory E. Maskin Jerusalem Summer School in Economic Theory June 2014.
1 Chapter 13 Resource Allocation and Negotiation Problems.
1 Heaps and Priority Queues Starring: Min Heap Co-Starring: Max Heap.
Copyright © 2010 Pearson Education, Inc. Slide
QR 38 3/13/07, Spatial models I.Unidimensional models II.Median voter theorem III.Multiple dimensions.
Introduction Many organizations use decision rules to alleviate incentive problems as opposed to incentive contracts The principal typically retains some.
CH2 : The Economic Problem: Scarcity and Choice Asst. Prof. Dr. Serdar AYAN.
By: Eric Zhang.  Indivisible items from multiple categories are allocated to agents without monetary transfer  Example – How paper presentations are.
CSCI1600: Embedded and Real Time Software Lecture 24: Real Time Scheduling II Steven Reiss, Fall 2015.
Dueling Estimates: Closing Thoughts Jennifer H. Madans National Center for Health Statistics.
 Assumptions are an essential part of statistics and the process of building and testing models.  There are many different assumptions across the range.
Social Experimentation & Randomized Evaluations Hélène Giacobino Director J-PAL Europe DG EMPLOI, Brussells,Nov 2011 World Bank Bratislawa December 2011.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
What is Impact Evaluation … and How Do We Use It? Deon Filmer Development Research Group, The World Bank Evidence-Based Decision-Making in Education Workshop.
CPU Scheduling G.Anuradha Reference : Galvin. CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time.
CPU SCHEDULING.
Regulatory Strategies and Solutions Group, LLC
Chapter 1 Introduction to Economics
Fair division Lirong Xia Oct 7, 2013.
Post Desegregation Consent Decree Plan
School Choice and the Boston Mechanism
CPU Scheduling G.Anuradha
Chapter 5: CPU Scheduling
Chapter 5: CPU Scheduling
Matching and Resource Allocation
AN APPROACH TO IDENTIFYING AN OPTIMAL GUARANTEED BASIC INCOME
Presentation transcript:

School choice procedures: How do they matter? Theory and evidence from Belgium Estelle Cantillon Nicolas Gothelf Université Libre de Bruxelles June 2009

Context –Freedom of choice is a constitutional right in Belgium –Education policy split along language lines –School choice has long been unregulated (left to parents and school principals) –Concerns about inequity prompted politicians to regulate school choice – Poor information about registration process foreclosed some parents – Examples of unjustified refusal to register / discrimination – Unregulated choice seen as one source of heterogeneity in student performance in PISA (Belgium has highest social segregation index in Europe after Hungary – Jenkins, Micklewright and Schnepf, 2008 )

Context - Flanders –First reform in 2003 – Set a common date to start registrations – First come, first served – Only permissible reason for refusal is that the school has reached capacity –Second reform in 2006 – Local coordination platforms at the metropolitan area level – Priorities to siblings, socially disadvantaged kids allowed through early registration periods –2008 reform – Following popular discontent over long queues in front of popular schools, new decree allows for distance instead of time as a tie-breaker (Gent metropolitan area adopted it) – LOPs allowed to experiment for two years

Context – French-speaking Belgium –Enrollment decree, 2007 – Set a common date for the start of registrations – Priorities for siblings – First come, first served otherwise – Result: Long queues minister resigned –Social diversity decree, 2008 – Combination of quotas (for borough versus non borough students, socially disadvantaged kids) and priorities (siblings over other kids), lottery as a tie-breaker – Decentralized application procedure – Result: bubble of multiple registrations leading to administrative burden, delays, and lots of kids without a school minister did not resign but decree dropped –Current situation: waiting for the new govt

This talk will take as given that -students preferences are a key input to the assignment decision of students to schools -capacity is scarce and we cannot give every student his/her first choice -students have different priorities at different schools and these priorities are (largely) set by law -Unconditional priorities (e.g. siblings) -Conditional priorities: quotas for specific categories of kids, priority up to the quota level

What this talk will focus on –Even when we have decided to take students preferences into account and what priorities they have at different schools, there still are several ways in which we can match students to schools –This talk will – summarize what we know and do not know about the properties of these different matching algorithms – Illustrate, using data from Dutch-speaking preschools in Brussels, the impact of this choice on outcomes

SCHOOL CHOICE PROCEDURES

Inputs to school choice mechanism –Preference reports by students over schools (rank order list, ROL) – Usually not needed in decentralized procedures – i 1 : s 1, s 2, s 7, s 4, … –Quotas and student priorities at each school – s 1 (q 11, q 12, …): i 1, i 3, i 4, i 2, … –School capacities Output is an assignment of each student to a school An assignment is feasible if it respects school capacities and quotas

Three criteria –Ex-post efficiency – An assignment is ex-post efficient if there does not exist another feasible assignment that every student prefers to the original assignment, and at least one student strictly prefers to the original assignment –No justified envy – There is no student that has a place in a school, whereas another one who actually has priority over that student at that school, and prefers that school to the school hes assigned to, does not have one. –Truthful elicitation of preferences – It is optimal for students to report their true preferences over schools.

Student-proposing deferred acceptance algorithm –Students submits their ROLs and schools their priorities over students (use of a tie-breaker if necessary) –Step 1: Each student proposes to her first choice. Each school tentatively assigns its seats to its proposers one at a time following their priority order. Any remaining proposer is rejected. –…–… –Step k: Each student who was rejected in the previous step proposes to her next choice. Each school considers the students it had tentatively accepted in the previous period together with the new proposers and accepts tentatively those with the highest priorities. It rejects other. –The algorithm terminates when no more requests are rejected.

School-proposing deferred acceptance algorithm –Students submits their ROLs and schools their priorities over students (use of a tie-breaker if necessary) –Step 1: Each school with capacity q s proposes to the q s highest ranked students. Each student accepts tentatively her most preferred schools among those that have offered her a seat. All other schools are rejected. –…–… –Step k: Each school student that had some of its offers rejected in the previous period, proposes its remaining seats to the next students on its priority order. Each student compares her new offers with the offer she had tentatively accepted in the previous period and keeps her preferred school. All other schools are rejected –The algorithm terminates when no more offers are rejected or there are no more students to make an offer to.

Students prefer the student-proposing DAA –4 kids, 2 schools with 2 seats each – Student preferences: – Student a: 1 2 – Student b: 1 2 – Student c: 1 2 – Student d: 2 1 – Priorities over students: – School 1: a d b c – School 2: b a c d School-proposing DAA, first round: Student a gets two offers. He rejects the offer from school 2 Round2: school 2 offers a seat to c Student-proposing DAA, first round: Students apply to their first choice school. School 1 rejects student c 12 Round 2: Student c applies to school 2 and is accepted All kids are better off

Top trading cycle –Step 1: Each student points to her favorite school and each school points to the student with the highest priority. There exists at least one cycle. Every student in a cycle is assigned a seat in the school she points to and is removed. The number of available seats at schools in a cycle is reduced by one. If this number is equal to zero, the school is removed –Step k: Each remaining student points to her favorite school among those available, and each school points to the student with the highest priority among those remaining. Every student in a cycle is assigned a seat in the school she points to and is removed. The number of available seats at schools in a cycle is reduced by one. If this number is equal to zero, the school is removed. –The algo terminates when all students are assigned a seat.

Comparisons among procedures EfficiencyNo justified envy Truthful preferences Information for public decisions First come, first served (enrollment decree, original GOK decree) NOYESNO School-proposing DAA (social diversity decree ) NOYESALMOSTYES if centralized Student-proposing DAA NOYES Top trading Cycle YESNOYES

Comparison among procedures –There is no procedure that satisfies all three first criteria (Roth, 1982) Lawmakers / policymakers will always need to make an arbitrage –Student-proposing DAA is not dominated on efficiency ground by any other envy-free and strategyproof mechanism (Abdulkaderoglu et al., 2009)

Current research frontier on school choice procedures Current research looks at – potential enhancements to the student-proposing DAA – other criteria for evaluating school choice mechanisms

PRELIMINARY EVIDENCE FROM DUTCH- SPEAKING PRESCHOOLS IN BRUSSELS

Data –Preschool population in Dutch-speaking preschools in Brussels as of 1 October 2008 (10,867 kids, 150 schools, entering class 4079) –Kid characteristics: age, location, nationality, GOK status, socioeconomic class of neighborhood, whether Dutch is spoken at home, school attended –School characteristics: location, network, confessional orientation, establishments, pedagogy

Legal constraints on the mechanisms Current procedure: – Siblings have priorities over other kids – 30% quota for GOK students – 45% quota for Dutch native speakers – Priorities and quotas implemented through early registration periods – First come, first served as a tie-breaker – Decentralized New GOK decree allows them to experiment with distance as a different tie-breaker

Analysis of the current situation – heterogeneity across schools

Analysis of the current situation – distance to school 1141 incoming students, 958 outgoing students,

Generating a counterfactual policy experiment –LOP Brussels is considering to replace its time priority with a distance-based tie breaker. –How will kids be impacted? How will schools be impacted? –Main challenge : We do not observe preferences over schools

Calibrating preferences Working assumptions: – Current procedure can be approximated by a student- proposing DAA with socioeconomic status, then distance as a tie-breaker – Brussels-based students have preferences over Brussels schools that depend on their socioeconomic status (top 30%, GOK, other) u is = α 1k distance is + α 2k quality s + (1- α 1k - α 2k )ε is They also have an outside option (random utility) and place the school where they have a sibling first – Out-of-Brussels students have preferences that take the form u is = δ quality s + (1- δ)ε is

Calibrating preferences (continued) Calibrate these preferences so that predicted outcome (distribution of ranks of assigned school) close to actual outcome α 1high = 0.55 α 1GOK = 0.70 α 1rest = 0.58 δ = 0.75 Weight on ε set to 0.05

Counterfactual 1: From time to distance as a tie- breaker – aggregate results

Counterfactual 1: Distributional aspects

Counterfactual 1: Impact on school population

Impact on school population (contd)

Counterfactual 1: Likely long term residential effects –Mean median distance to school goes from 1.45 km to 0.9 km –Mean max distance to school goes from km to km – max distance goes down in 41 schools out of 147 – Min max distance goes from 0.94 km to 0.45 km

Counterfactual 2: School-proposing DAA

CONCLUSIONS

Conclusions –Even when everything seems to be decided (priorities, quotas, ….) there are still a lot of non trivial choices to make –Very little attention is devoted to these design choices in legal texts or administrative directives –Yet some of these choices may have first order effects on outcomes –We have shown this with data from Dutch- speaking primary schools in Brussels