This paper studies allocation correspondences in the house allocation problems with collective initial endowments. We examine the implications of two axioms, namely “consistency” and “unanimity.” Consistency requires the allocation correspondence be invariant under reductions of...

We consider situations where a society allocates a finite units of an indivisible good among agents, and each agent receives at most one unit of the good. For example, imagine that a government allocates a fixed number of licences to private firms, or imagine that a government distributes...

This paper studies the problem of fairly allocating an amount of a divisible resource when preferences are single-peaked. We characterize the class of envy-free and peak-only rules and show that the class forms a complete lattice with respect to a dominance relation. We also pin down the...

This paper considers the object allocation problem introduced by Shapley and Scarf (1974). We study secure implementation (Saijo, Sjöström, and Yamato, 2007), that is, double implementation in dominant strategy and Nash equilibria. We prove that (i) an individually rational solution is...

We consider the problem of allocating infinitely divisible commodities among a group of agents. Especially, we focus on the case where there are several commodities to be allocated, and agents have continuous, strictly convex, and separable preferences. In this paper, we establish that the...