We consider the following allocation problem: A fixed number of public facilities must be located on a line. Society is composed of N agents, who must be allocated to one and only one of these facilities. Agents have single peaked preferences over the possible location of the facilities they are...

We correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Using the assignment of students to schools as our leading example, we study many-to-one two-sided matching markets without transfers. Students are endowed with cardinal preferences and schools with ordinal ones, while preferences of both sides need not be strict. Using the idea of a competitive...

In this note we show that no solution to coalition formation games can satisfy a set of axioms that we propose as reasonable. Our result points out that "solutions" to the coalition formation cannot be interpreted as predictions of what would be ìresting pointsî for a game in the way stable...

We show that the full version of the so-called "rural hospital theorem" generalizes to many-to-many matching problems where agents on both sides of the problem have substitutable and weakly separable preferences. We reinforce our result by showing that when agents' preferences satisfy...

We give a simple and concise proof that so-called generalized median stable matchings are well-defined for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions markets, the...