We propose two Mathematical Programming with Equilibrium Constraints (MPEC) formulations: the MPEC-Sparse and the MPEC-Dense to estimate a class of separable matching models. We compare MPEC with the Nested Fixed-Point (NFXP) algorithm -- a well-received method in the literature of structural...

The problem of demand inversion -- a crucial step in the estimation of randomutility discrete-choice models -- is equivalent to the determination of stable outcomes intwo-sided matching models. This equivalence applies to random utility models that are notnecessarily additive, smooth, nor even...

We propose an alternative notion of non-transferable utility (NTU) stability in matching models that relies on money burning. Our model captures an exchange economy with indivisible goods, fixed prices, and no centralized assignment mechanism. In these models, a non-transferable numeraire (e.g.,...