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...

Consider a problem in which the cost of building an irrigation canal has to be divided among a set of people. Each person has different needs. When the needs of two or more people overlap, there is congestion. In problems without congestion, a unique canal serves all the people and it is enough...

We study many-to-one matching markets where hospitals have responsive preferences over students. We study the game induced by the student-optimal stable matching mechanism. We assume that students play their weakly dominant strategy of truth-telling.

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...

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 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 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 (Abdulkadiroglu and Sönmez, 2003) where students are assigned to public schools through a centralized assignment mechanism. We study the family of so-called rank-priority mechanisms, each of which is induced by an order of rank-priority pairs. Following the...