dc.contributor.author | BALTER, Janine | |
dc.contributor.author | RANCAN, Michela | |
dc.contributor.author | SENYUTA, Olena | |
dc.date.accessioned | 2019-03-01T14:54:04Z | |
dc.date.available | 2019-03-01T14:54:04Z | |
dc.date.issued | 2016 | |
dc.identifier.citation | International journal of computational economics and econometrics, 2016, Vol. 6, No. 4, pp. 413-431 | |
dc.identifier.issn | 1757-1170 | |
dc.identifier.issn | 1757-1189 | en |
dc.identifier.uri | https://hdl.handle.net/1814/61543 | |
dc.description.abstract | 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. | |
dc.language.iso | en | |
dc.publisher | Inderscience Publishers | en |
dc.relation.ispartof | International journal of computational economics and econometrics | |
dc.subject | Matching markets | |
dc.subject | Truncation | |
dc.subject | Gale-Shapley deferred acceptance algorithm | |
dc.title | Limit your applications : dealing with congested markets in the matching procedure | |
dc.type | Article | |
dc.identifier.doi | 10.1504/IJCEE.2016.079534 | |
dc.identifier.volume | 6 | |
dc.identifier.startpage | 413 | |
dc.identifier.endpage | 431 | |
eui.subscribe.skip | true | |
dc.identifier.issue | 4 | |