Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/191574
Title: | Limited farsightedness in priority-based matching |
Author: | Atay, Ata Mauleon, Ana Vannetelbosch, Vincent |
Keywords: | Anàlisi de necessitats Algorismes Matemàtica Needs assessment Algorithms Mathematics |
Issue Date: | 2022 |
Publisher: | Universitat de Barcelona. Facultat d'Economia i Empresa |
Series/Report no: | [WP E-Eco22/438] |
Abstract: | We consider priority-based matching problems with limited farsightedness. We show that, once agents are sufficiently farsighted, the matching obtained from the Top Trading Cycles (TTC) algorithm becomes stable: a singleton set consisting of the TTC matching is a horizon-$k$ vNM stable set if the degree of farsightedness is greater than three times the number of agents in the largest cycle of the TTC. On the contrary, the matching obtained from the Deferred Acceptance (DA) algorithm may not belong to any horizon-$k$ vNM stable set for $k$ large enough. |
It is part of: | UB Economics – Working Papers, 2022, E22/438 |
URI: | http://hdl.handle.net/2445/191574 |
Appears in Collections: | UB Economics – Working Papers [ERE] |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
E22-438_Atay et al-2.pdf | 489.29 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License