We study the problem of dissolving an equal-entitlement partnership when the objective is to minimize maximum regret. We initially focus on the family of linear-pricing mechanisms and derive regret-optimizing strategies. We also demonstrate that there exist linear-pricing mechanisms satisfying...

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

In a dynamic model of assignment problems, small deviations suffice to move between stable outcomes. This result is used to obtain no-selection and almost-no-selection results under the stochastic stability concept for uniform and payoff-dependent errors. There is no-selection of partner or...

Assume it is known that one player in a 2 x 2 game can detect the strategy choice of its opponent with some probability before play commences. We formulate conditions under which the detector can, by credibly committing to a strategy of probabilistic tit-for-tat (based on its imperfect...

Many procedures have been suggested for the venerable problem of dividing a set of indivisible items between two players. We propose a new algorithm (AL), related to one proposed by Brams and Taylor (BT), which requires only that the players strictly rank items from best to worst. Unlike BT, in...

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