One-sided assignment problems combine important features of two well-known matching models. First, as in roommate problems, any two agents can be matched and second, as in two-sided assignment problems, the payoffs of a matching can be divided between the agents. We take a similar approach to...

In practice we often face the problem of assigning indivisible objects (e.g., schools, housing, jobs, offices) to agents (e.g., students, homeless, workers, professors) when monetary compensations are not possible. We show that a rule that satisfies consistency, strategy-proofness, and...

We consider a problem of allocating indivisible objects when agents may desire to consume more than one object and no monetary transfers are allowed. We are interested in allocation rules that satisfy desirable properties from an economic and social point of view. In addition to...

We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. Klaus (2010) introduced two new "population sensitivity" properties that capture the effect newcomers...