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

We consider the problem of allocating an amount of a perfectly divisible good among a group of n agents. We study how large a preference domain can be to allow for the existence of strategy-proof, symmetric, and efficient allocation rules when the amount of the good is a variable. This question...

This note studies the allocation of heterogeneous commodities to agents whose private values for combinations of these commodities are monotonic by inclusion. This setting can accommodate the presence of complementarity and substitutability among the heterogeneous commodities. By using induction...

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

In a recent paper, Sprumont (1991) showed that the uniform rule (Benassy, 1982) on the single-peaked domain (Black, 1948) is the only rule that satisfies strategy-proofness, anonymity, and efficiency. This result motivates us to investigate whether there is a larger domain on which there exists...

We consider the economy consisting of n agents and m heterogenous objects where the seller benefits v from objects. Our study focuses on the multi-object allocation problem with monetary transfers where each agent obtains at most one object (unit-demand). In the situation with arbitrary n, m and...