Consider an environment with a finite number of alternatives, and agents with private values and quasilinear utility functions. A domain of valuation functions for an agent is a monotonicity domain if every finite-valued monotone randomized allocation rule defined on it is implementable in...

We study how to reduce congestion in two-sided matching markets with private preferences. We measure congestion by the number of bits of information that agents must (i) learn about their own preferences, and (ii) communicate with others before obtaining their final match. Previous results by...

It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a general class of large random markets the algorithm will nd a stable matching with high probability. In particular we...