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

We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other....

In this note we study von Neumann-Morgenstern farsightedly stable sets for Shapley and Scarf (1974) housing markets. Kawasaki (2008) shows that the set of competitive allocations coincides with the unique von Neumann-Morgenstern stable set based on a farsighted version of antisymmetric weak...

In the context of resource allocation on the basis of priorities, Ergin (2002) identifies a necessary and sufficient condition on the priority structure such that the student-optimal stable mechanism satisfies a consistency principle. Ergin (2002) formulates consistency as a local property based...