In this paper 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, which is a similar data structure as in Fox (2010). Our estimator is based on stability conditions in...

This paper develops a measure of segregation based on two premises: (1) a measure of segregation should disaggregate to the level of individuals, and (2) an individual is more segregated the more segregated are the agents with whom she interacts. Developing three desirable axioms that any...

I present a simple and fast algorithm that finds all the pure-strategy Nash equilibria in games with strategic complementarities. This is the first non-trivial algorithm for finding all pure-strategy Nash equilibria

We investigate the testable implications of the theory of stable matchings. We provide a characterization of the data that are rationalizable as a stable matching when agents' preferences are unobserved. The characterization is a simple nonparametric test for stability, in the tradition of...