Limit your applications. Dealing with congested markets in the matching procedure

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11640%2F16%3A00463941" target="_blank" >RIV/00216208:11640/16:00463941 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1504/IJCEE.2016.079534" target="_blank" >http://dx.doi.org/10.1504/IJCEE.2016.079534</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1504/IJCEE.2016.079534" target="_blank" >10.1504/IJCEE.2016.079534</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Limit your applications. Dealing with congested markets in the matching procedure

Popis výsledku v původním jazyce

We study congested matching markets, such as the PhD academic job market, and consider alternative mechanisms that could be implemented by a social planner. Building on the Gale and Shapley algorithm, we analyse (i) a procedure accounting for a limit in the number of applications PhD graduates can submit (PhD-LIMIT), and (ii) a procedure accounting for a limit in the number of applications universities can evaluate (UNI-LIMIT). We find that the PhD-LIMIT procedure improves the matching outcome and is preferable to a UNI-LIMIT procedure. The optimal limit in the number of applications balances the trade-off between being unmatched and gaining a better match in the aggregate, and the benefit can be considerable if the graduates’ preferences over the positions are not very correlated. Overall, we suggest a direction to improve the matching market for PhD candidates by improving the outcome of their matches and lowering the hiring costs for universities.

Název v anglickém jazyce

Limit your applications. Dealing with congested markets in the matching procedure

Popis výsledku anglicky

We study congested matching markets, such as the PhD academic job market, and consider alternative mechanisms that could be implemented by a social planner. Building on the Gale and Shapley algorithm, we analyse (i) a procedure accounting for a limit in the number of applications PhD graduates can submit (PhD-LIMIT), and (ii) a procedure accounting for a limit in the number of applications universities can evaluate (UNI-LIMIT). We find that the PhD-LIMIT procedure improves the matching outcome and is preferable to a UNI-LIMIT procedure. The optimal limit in the number of applications balances the trade-off between being unmatched and gaining a better match in the aggregate, and the benefit can be considerable if the graduates’ preferences over the positions are not very correlated. Overall, we suggest a direction to improve the matching market for PhD candidates by improving the outcome of their matches and lowering the hiring costs for universities.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

AH - Ekonomie

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2016

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal of Computational Economics and Econometrics

ISSN

1757-1170

e-ISSN

—

Svazek periodika

6

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

19

Strana od-do

413-431

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—