Abstract This paper studies a general model of matching with constraints. Observing that stable typically does not exist, we focus on feasible, individually rational, and fair matchings. We characterize such matchings by fixed points certain function. Building this result, the class constraints individual schools under which there exists student-optimal matching, is most preferred every student...