2000 character limit reached
School Choice with Farsighted Students
Published 14 Dec 2022 in econ.TH and cs.GT | (2212.07108v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.