We study problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study...

We study problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study...

We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other....

We consider two-sided many-to-many matching markets in which each worker may work for multiple firms and each firm may hire multiple workers. We study individual and group manipulations in centralized markets that employ (pairwise) stable mechanisms and that require participants to submit rank...

We consider school choice problems. We are interested in solutions that satisfy consistency. Consider a problem and a recommendation made by the solution for the problem. Suppose some students are removed with their positions in schools. Consider the “reduced” problem consisting of the...

This paper studies many-to-one matching markets where each student is assigned to a hospital. Each hospital has possibly multiple positions and responsive preferences. We study the game induced by the student-optimal stable matching mechanism. We assume that students play their weakly dominant...