ESSAYS ON TWO-SIDED MATCHING

Abstract

This thesis consists of three chapters on two-sided matching. In the first chapter, we study DA processes under the college admissions model, which are time-consuming and costly in offer making. We show how and to what extent the process can be accelerated using feedback. At the same time, the number of rejected offers is also significantly reduced. The improvement from feedback is estimated by simulations in the context of the Ph.D. admission. In the second chapter, we study path-to-stability problem in matching with one-sided incomplete information. We define stability, describe a conservative learning pattern, and show the convergence of learning-blocking paths. The convergence is robust with respect to learning patterns. In the last chapter, we provide a blocking notion which involves higher order reasoning stemming from two-sided incomplete information. We also use the framework to study ex ante stability and Bayesian stability.