We study problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study...

We correct an omission in the definition of the domain of weakly responsive preferences introduced in [B. Klaus, F. Klijn, Stable matchings and preferences of couples, J. Econ. Theory 121 (2005) 75-106] or KK05 for short. The proof of the existence of stable matchings [KK05, Theorem 3.3] and a...

Recently, several school districts in the US have adopted or consider adopting the Student-Optimal Stable mechanism or the Top Trading Cycles mechanism to assign children to public schools. There is evidence that for school districts that employ (variants of) the so-called Boston mechanism the...

We show that one of the main results in Chen and Sönmez (2006, 2008) [6] and [7] does no longer hold when the number of recombinations is sufficiently increased to obtain reliable conclusions. No school choice mechanism is significantly superior in terms of efficiency.

We show that for any roommate market the set of stochastically stable matchings coincides with the set of absorbing matchings. This implies that whenever the core is non-empty (e.g., for marriage markets), a matching is in the core if and only if it is stochastically stable, i.e., stochastic...