no code implementations • 12 Mar 2023 • Job Boerma, Aleh Tsyvinski, Ruodu Wang, Zhenyuan Zhang
We completely characterize optimal sorting and additionally show it is more positive when mismatch costs are less concave.
no code implementations • 28 Apr 2022 • Job Boerma, Aleh Tsyvinski, Alexander P. Zimin
Blunt bunching constitutes 30 percent of all bunching, occurs at the lowest regions of cognitive and manual skills, and lumps the allocations of these workers resulting in a significant distortion.
no code implementations • 6 Sep 2021 • Job Boerma, Aleh Tsyvinski, Alexander P. Zimin
We fully solve a sorting problem with heterogeneous firms and multiple heterogeneous workers whose skills are imperfect substitutes.
