title   
  

Preference respecting stable matchings in school choice problems

Şimşek, Ali (2017) Preference respecting stable matchings in school choice problems. [Thesis]

[img]PDF (Restricted to Repository staff only until 17.07.2020) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
691Kb

Official URL: http://risc01.sabanciuniv.edu/record=b1669293 (Table of Contents)

Abstract

We introduce a new stability notion called preference respecting stability that incorporates tolerance values for schools and attaches importance to both the preferences of students and the priorities of schools, and study its properties. We find that a preference respecting stable allocation exists in any school choice problem, and it Pareto-dominates the Gale-Shapley stable allocation. We construct a two part mechanism that depends on improvement cycles to reach a constrained efficient preference respecting stable allocation. Our mechanism is a natural generalization of a broad class of mechanisms and admits the student-optimal Stable Mechanism and the Boston Mechanism as special cases. We also study its strategic properties under complete and incomplete information settings and find that truthful reporting of preferences is an ordinal Bayesian Nash equilibrium for the students.

Item Type:Thesis
Additional Information:Yükseköğretim Kurulu Tez Merkezi Tez No: 483287.
Uncontrolled Keywords:Matching theory. -- School choice. -- Boston mechanism. -- Student-optimal stable mechanism. -- Pareto-efficiency. -- Eşleşme Teorisi. -- Okul seçimi. -- Boston mekanizması. -- Öğrenci- optimal sabit mekanizma, Pareto-verimlilik.
Subjects:H Social Sciences > HB Economic Theory
ID Code:34593
Deposited By:IC-Cataloging
Deposited On:27 Apr 2018 16:22
Last Modified:27 Apr 2018 16:22

Repository Staff Only: item control page