Logo
Munich Personal RePEc Archive

Sorting On-line and On-time

Banfi, Stefano and Choi, Sekyu and Villena-Roldán, Benjamin (2019): Sorting On-line and On-time.

[thumbnail of MPRA_paper_91763.pdf] PDF
MPRA_paper_91763.pdf

Download (890kB)

Abstract

Using proprietary data from a Chilean online job board, we find strong, positive assortative matching at the worker-position level, both along observed dimensions and on unobserved characteristics (OLS Mincer residual wages). We also find that this positive assortative matching is robustly procyclical. Since we use information on job applications instead of final matches, we use the generalized deferred-acceptance algorithm to simulate tentative final allocations. Under all considered scenarios for the algorithm, positive assortative matching is preserved from the application stage to the realized matches.

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.