We consider a school choice matching model where priorities for schools are represented by binary relations that may not be total orders. Even in that case, it is necessary to construct total orders from the priority relations to execute several mechanisms. We focus on the extensions of the...

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 provide a school choice model where the student priority orders are allowed not to be total. We introduce a class of algorithms each of which derive a student optimal stable matching once we have an initial stable matching. Since there is a method to derive a stable matching, we can derive a...

This study considers a school choice problem with general feasibility constraints. Each student belongs to a grade; and two students belonging to the same grade are symmetric, whereas those belonging to different grades can be asymmetric with respect to the feasibility constraint of a school. 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...