We study situations of allocating positions or jobs to students or workers based on priorities. An example is the assignment of medical students to hospital residencies on the basis of one or several entrance exams. For markets without couples, e.g., for ``undergraduate student placement,''...

We study two-sided matching markets with couples and show that for a natural preference domain for couples, the domain of weakly responsive preferences, stable outcomes can always be reached by means of decentralized decision making. Starting from an arbitrary matching, we construct a path of...

We extend Jackson and Watts's (2002) result on the coincidence of S-stochastically stable and core stable networks from marriage problems to roommate problems. In particular, we show that the existence of a side-optimal core stable network, on which the proof of Jackson and Watts (2002) hinges,...

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

We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable mechanisms: employment by lotto (Aldershof et al., 1999) and the random order mechanism (Roth and Vande Vate, 1990, Ma, 1996). For both mechanisms we give various examples of probability...

Thomson (1995a) proved that the uniform allocation rule is the only allocation rule for allocation economies with single-peaked preferences that satisfies Pareto efficiency, no-envy,one-sided population-monotonicity, and replication-invariance on a restricted domain of single-peaked preferences....

We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable mechanisms: employment by lotto (Aldershof et al. , 1999) and the random order mechanism (Roth and Vande Vate, 1990, Ma, 1996). For both mechanisms we give various examples of probability...

We study the simple model of assigning indivisible and heterogenous objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. For this model, known as the house allocation model, we characterize the class of rules...

In college admissions and student placements at public schools, the admission decision can be thought of as assigning indivisible objects with capacity constraints to a set of students such that each student receives at most one object and monetary compensations are not allowed. In these...