Potent immunosuppressant drugs suppress the body’s ability to reject a transplanted organ up to the point that a transplant across blood- or tissue-type incompatibility becomes possible. In contrast to the standard kidney exchange problem, our setting also involves the decision about which...

We investigate the matching algorithm used by the German central clearinghouse for university admissions (ZVS) in medicine and related subjects. This mechanism consists of three procedures based on final grades from school ("Abiturbestenverfahren", "Auswahlverfahren der Hochschulen") and on...

This paper analyses the efficiency of the equilibrium allocation in a matching model with two types of workers and jobs. The basic assumption is that high-skill workers can perform both skilled and unskilled jobs, while low-skill workers can only perform unskilled jobs. Our first result shows...

The proposed game is a natural extension of the Shapley and Shubik Assignment Game to the case where each seller owns a set of different objets instead of only one indivisible object. We propose definitions of pairwise stability and group stability that are adapted to our framework. Existence of...

In this paper we answer a question posed by Sertel and Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.

The literature on school choice assumes that families can submit a preference list over all the schools they want to be assigned to. However, in many real-life instances families are only allowed to submit a list containing a limited number of schools. Subjects' incentives are drastically...