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 this paper, we pose the following question in a private-good model. To what extent can the single-peaked domain be enlarged while preserving the existence of rules satisfying strategy-proofness, symmetry and unanimity? This formulation is adopted for three reasons. First, it marks a clear...

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

This paper studies a model of mechanism design with transfers where agents' preferences need not be quasilinear. In such a model:(1) we characterize dominant strategy incentive compatible mechanisms using a monotonicity property; (2) we establish a revenue uniqueness result: for every dominant...