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.

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...

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...

Couples looking for jobs in the same labor market may cause instabilities. We determine a natural preference domain, the domain of weakly responsive preferences, that guarantees stability. Under a restricted unemployment aversion condition we show that this domain is maximal for the existence of...

We study situations of allocating positions to students based on priorities. An example is the assignment of medical students to hospital residencies on the basis of entrance exams. For markets without couples, e.g., for undergraduate student placement, acyclicity is a necessary and sufficient...

We study procedurally fair matching mechanisms that produce stable matchings for the so-called marriage model of one-to-one, two-sided matching. Our main focus is on two such mechanisms: employment by lotto introduced by Aldershof et al. (1999) and the random order mechanism due to Roth and...

Using a bi-choice graph technique (Klaus and Klijn, 2009), we show that a matching for a roommate market indirectly dominates another matching if and only if no blocking pair of the former is matched in the latter (Proposition 1). Using this characterization of indirect dominance, we investigate...