A desirable house allocation rule is flexible in its response to changes in agents' preferences. We propose a specific notion of this flexibility. An agent is said to be `swap-sovereign' over a pair of houses at a profile of preferences if the rule assigns her one of the houses at that profile...

We reinterpret the `bossiness' of a private-goods allocation rule (Satterthwaite and Sonneschein, 1981) as the ability of an agent to `influence' another's welfare with no change to her own welfare. We propose simple conditions on (1) which agents may have influence (`acyclicity' and...

We consider a model in which projects are to be assigned to agents based on their preferences, and where projects have capacities, i.e., can each be assigned to a minimum and maximum number of agents. The extreme cases of our model are the social choice model (the same project is assigned to all...

Students participating in centralized admissions procedures do not typically have access to the information used to determine their matched school, such as other students' preferences or school priorities. This can lead to doubts about whether their matched schools were computed correctly (the...

The COVAX initiative has allocated over 1.9 billion units of vaccines in a centralised framework to over 150 countries towards achieving countries’ self-reported demands. However, recipient countries are not always eligible for vaccines from all sources due to export licensing restrictions or...

In this note we study the allocation and exchange of discrete resources in environ- ments in which monetary transfers are not allowed. We allow each discrete resource to be represented by several copies, extend onto this environment the trading cycles mechanisms of Pycia and Ünver [2009], and...

Allocation and exchange of discrete resources such as kidneys, school seats, and many other resources for which agents have single-unit demand is conducted via direct mechanisms without monetary transfers. Incentive compatibility and efficiency are primary concerns in designing such mechanisms....

Ordinal random mechanisms have been used in real-life situations for reasons such as sustaining fairness or preventing collusion. Two examples of such domains are voting and matching. We investigate whether desirable properties of a random mechanism survive decomposition as a lottery over...