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

We search for impartiality in the allocation of objects when monetary transfers are not possible. Our main focus is anonymity. The standard definition requires that if agents' names are permuted, their assignments should be permuted in the same way. Since no rule satisfies this definition in...

We consider situations where a society tries to efficiently allocate several homogeneous and indivisible goods among agents. Each agent receives at most one unit of the good. For example, suppose that a government wishes to allocate a fixed number of licenses to operate in its country to private...

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

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barberá (1994) show that effcient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof...

We consider the multi-object allocation problem with monetary transfers where each agent obtains at most one object (unit-demand). We focus on allocation rules satisfying individual rationality, no subsidy, efficiency, and strategy-proofness. Extending the result of Morimoto and Serizawa (2015),...

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

We consider the multi-object allocation problem with monetary transfers where each agent obtains at most one object (unit-demand). We focus on allocation rules satisfying individual rationality, non-waste fulness, equal treatment of equals, and strategy-proofness. Extending the result of...