We compare different preference restrictions that ensure the existence of a stable roommate matching. Some of these restrictions are generalized to allow for indifferences as well as incomplete preference lists, in the sense that an agent may prefer remaining single to matching with some agents....

In this note, we examine the connection between the roommate model and the partnership formation model (Talman and Yang, 2011, Journal of Mathematical Economics 47, 206-212). Upon noting that both occasionally lack equilibria we look at the stable partnerships model, a combination of the former...

A group of heterogenous agents may form partnerships in pairs. All single agents as well as all partnerships generate values. If two agents choose to cooperate, they need to specify how to split their joint value among one another. In equilibrium, which may or may not exist, no agents have...

A group of heterogeneous agents may form partnerships in pairs. All single agents as well as all partnerships generate values. If two agents choose to cooperate, they need to specify how to split their joint value among one another. In equilibrium, which may or may not exist, no agents have...

We introduce externalities into a two-sided, one-to-one assignment game by letting the values generated by pairs depend on the behavior of the other agents. Extending the notion of blocking to this setup is not straightforward; a pair has to take into account the possible reaction of the residual...

We compare different preference restrictions that ensure the existence of a stable roommate matching. Some of these restrictions are generalized to allow for indifferences as well as incomplete preference lists, in the sense that an agent may prefer remaining single to matching with some agents....

We characterize the core of the partnership formation problem (Talman and Yang, Journal of Mathematical Economics 47, 2011) using cycles in the solution of a linear programming problem. The cycles also lead us to a new and intuitive sufficient condition for the existence of equilibrium,...

We present a polynomial time method for identifying the maximal set in excess demand at a given payoff vector. This set can be used in "large" partnership formation problems to identify the minimum element in the set of individually rational payoff vectors at which there is no overdemanded set...

We study two-sided ("marriage") and general pairing ("roommate") problems. We introduce "sequences," lists of matchings that are repeated in order. Stable sequences are natural extensions of stable matchings; case in point, we show that a sequence of stable matchings is stable. In addition,...

We study two-sided ("marriage") and general pairing ("roommate") problems. We introduce "sequences," lists of matchings that are repeated in order. Stable sequences are natural extensions of stable matchings; case in point, we show that a sequence of stable matchings is stable. In addition,...