School Choice with Farsighted Students

12/14/2022
by   Ata Atay, et al.
0

We consider priority-based school choice problems with farsighted students. We show that a singleton set consisting of the matching obtained from the Top Trading Cycles (TTC) mechanism is a farsighted stable set. However, the matching obtained from the Deferred Acceptance (DA) mechanism may not belong to any farsighted stable set. Hence, the TTC mechanism provides an assignment that is not only Pareto efficient but also farsightedly stable. Moreover, looking forward three steps ahead is already sufficient for stabilizing the matching obtained from the TTC.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2022

Limited Farsightedness in Priority-Based Matching

We consider priority-based matching problems with limited farsightedness...
research
07/05/2022

Online 2-stage Stable Matching

We focus on an online 2-stage problem, motivated by the following situat...
research
12/16/2022

On the Complexities of Understanding Matching Mechanisms

We study various novel complexity measures for two-sided matching mechan...
research
09/19/2023

Multi-Stage Generalized Deferred Acceptance Mechanism: Strategyproof Mechanism for Handling General Hereditary Constraints

The theory of two-sided matching has been extensively developed and appl...
research
10/15/2018

Playing on a Level Field: Sincere and Sophisticated Players in the Boston Mechanism with a Coarse Priority Structure

Who gains and who loses from a manipulable school choice mechanism? We e...
research
11/24/2020

Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof

We study the strategic simplicity of stable matching mechanisms where on...
research
05/25/2022

A Continuum Model of Stable Matching With Finite Capacities

This paper introduces a unified framework for stable matching, which nes...

Please sign up or login with your details

Forgot password? Click here to reset