In this note we extend Jackson and WattsJET2002''s result on the coincidence of S-stochastically stable and core stable networks from the marriage problem to the solvable roommate problem. In particular, we show that the polarization structure of the marriage problem on which the proof of...

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. We investigate two new properties that capture the effect a newcomer has on incumbent agents....

We study efficient and individually rational exchange rules for markets with heterogeneous indivisible goods that exclude the possibility that an agent benefits by bundling goods in her endowment. Even if agents'' preferences are additive, no such rule exists.

We consider multiple-type housing markets. To capture the dynamic aspect of trade in such markets, we study a dynamic recontracting process similar to the one introduced by Serrano and Volij (2005). First, we analyze the set of recurrent classes of this process as a (non-empty) solution concept....

We consider the problem of allocating an infinitely divisible commodity among a group of agents with single-peaked preferences. A rule that has played a central role in the previous analysis of the problem is the so-called uniform rule. Thomson (1995a) proved that the uniform rule is the only...

We consider one-to-one matching (roommate) problems in which agents (students) can either be matched as pairs or remain single. The aim of this paper is twofold. First, we review a key result for roommate problems (the “lonely wolf” theorem) for which we provide a concise and elementary...

We consider the problem of (re)allocating the total endowment of an infinitely divisible commodity among agents with single-peaked preferences and initial endowments. We propose an extension of the so-called uniform rule and show that it is the unique rule satisfying strategy-proofness, Pareto...

In practice we often face the problem of assigning indivisible objects (e.g., schools, housing, jobs, offices) to agents (e.g., students, homeless, workers, professors) when monetary compensations are not possible. We show that a rule that satisfies consistency, strategy-proofness, and...

We consider several notions of setwise stability for many-to-many matching markets with contracts and provide an analysis of the relations between the resulting stable sets and pairwise stable sets for general, substitutable, and strongly substitutable preferences. Apart from obtaining “set...

We show that for any roommate market the set of stochastically stable matchings coincideswith 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...