Jump to ContentJump to Main Navigation
The Handbook of Market Design$
Users without a subscription are not able to see the full content.

Nir Vulkan, Alvin E. Roth, and Zvika Neeman

Print publication date: 2013

Print ISBN-13: 9780199570515

Published to Oxford Scholarship Online: January 2014

DOI: 10.1093/acprof:oso/9780199570515.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 22 October 2020

Improving Efficiency in School Choice

Improving Efficiency in School Choice

(p.170) Chapter 6 Improving Efficiency in School Choice
The Handbook of Market Design

Aytek Erdil

Haluk Ergin

Oxford University Press

A growing number of cities adopt school choice schemes which allow parents to express a preference list over the schools available. Then a centralised mechanism assigns students to schools as efficiently as possible taking these preferences as the welfare criteria. Whenever a school receives more applications than it can accommodate, an exogenously given priority order is used. Respecting priorities (stability) and providing incentives for truthful preference revelation (strategy-proofness) put constraints on the feasible assignment mechanisms, typically leading to inefficiency. The chapter reviews some of the important issues arising from this interplay of efficiency, stability and strategy-proofness.

Keywords:   school selection, school assignment, school preferences, assignment mechanisms

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .