We consider a pairwise kidney exchange model. Roth et al. (2005) define priority matchings of the model and introduce a mechanism to derive them. In this paper, we re-examine the priority matching. First, we consider a general priority ordering where multiple patients may hold equal priority. We...

We consider a controlled school choice model where students are divided into several types such as socioeconomically advantaged and disadvantaged. The priority for a school is dependent on the type distribution of the assignment. Our model is a generalization of several models in previous...

This study analyzes the number of matches in stable and efficient matchings. The benchmark number of matches is the largest one among the matchings in which no agent can be better off by itself. We show that, in the one-to-one matching model, the number of matches in any stable matching is more...

We consider a stable improvement problem in a controlled school choice model which covers those of several previous studies. First, we consider the case where the priority for each school is a weak order. We derive a sufficient condition for a stable matching to be constrained efficient. It is...

We consider school choice when the priority of a student for a school is conditional on who the other students are. Students have one of several types and the type distribution in the school matters. As a special class of our priority rules, we introduce the adjusted scoring rules and show that...