Pith. sign in

REVIEW

Time-constrained Dynamic Mechanisms for College Admissions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.12179 v1 pith:QJKDR6W5 submitted 2022-07-25 econ.TH

Time-constrained Dynamic Mechanisms for College Admissions

classification econ.TH
keywords dynamicmechanismsconstraintstimeadmissionsmechanismoutcomestudents
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Recent literature shows that dynamic matching mechanisms may outperform the standard mechanisms to deliver desirable results. We highlight an under-explored design dimension, the time constraints that students face under such a dynamic mechanism. First, we theoretically explore the effect of time constraints and show that the outcome can be worse than the outcome produced by the student-proposing deferred acceptance mechanism. Second, we present evidence from the Inner Mongolian university admissions that time constraints can prevent dynamic mechanisms from achieving stable outcomes, creating losers and winners among students.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.