We consider the problem of statistical analysis on assortative matching. The random vector of interests consists of the …

We study estimation and non-parametric identification of preferences in two-sided matching markets using data from a … other that does not use information available in many-to-one matching. We also prove consistency of a method of moments … estimator for a parametric model under a data generating process in which the size of the matching market increases, but data …

The objective of this paper is to apply a matching model to identify structural differences contributing to black …/white discrepancies in intermarriage behavior. I propose a measurement of type for each individual, and I also propose a general matching …

-- which interact through a decentralized matching process presenting common features across four markets -- goods, labor …

interact in a search and matching labour market. Workers acquire experience over time while being employed in a junior position …

matching M is popular if there is no matching M' such that the number of vertices that prefer M' to M exceeds the number of … vertices that prefer M to M'. We show that the problem of deciding whether G admits a popular matching or not is NP-hard. This …(n2) algorithm (where n = |A B|) for the popular matching problem in this model. Note that this model is quite different …

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected … maximum weight many-to-one matching satisfying two sets of constraints: vertices in A are incident to at most one matching … edge, while vertices in P are either unmatched or they are incident to a number of matching edges between their lower and …

-SRI, involves finding an egalitarian stable matching in solvable instances of SRI with preference lists of length at most d. We show …-SRTI admits a stable matching is NP-complete even if d = 3. We also consider the "most stable" version of this problem and prove a …