We propose a methodology for estimating preference parameters in matching models. Our estimator applies to repeated observations of matchings among a fixed group of individuals. Our estimator is based on the stability conditions in matching models; we consider both transferable (TU) and...

We study a dynamic matching environment where individuals arrive sequentially. There is a trade‐off between waiting for a thicker market, allowing for higher‐quality matches, and minimizing agents' waiting costs. The optimal mechanism cumulates a stock of incongruent pairs up to a threshold...

We consider a model of the criminal court process, focusing on plea bargaining. A plea bargain provides unequal incentives to go to trial because innocent defendants are more willing to plead not guilty. We show that the court process implements the preferences of the person or group who is most...

We study collective choices from the revealed preference theory viewpoint. For every product set of individual actions, joint choices are called Nash-rationalizable if there exists a preference relation for each player such that the selected joint actions are Nash equilibria of the corresponding...