The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and...

We consider the problem of allocating multiple units of an indivisible object among a set of agents and collecting payments. Each agent can receive multiple units of the object, and has a (possibly) non-quasi-linear preference on the set of (consumption) bundles. We assume that preferences...

A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number k of public facilities to be located. We consider public facilities that do not suffer from congestion and are non-excludable. We provide a characterization of...

This paper studies the application of the notion of secure implementation (Cason, Saijo, Sjöström, and Yamato, 2006; Saijo, Sjöström, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal...

We consider the problem of fairly reallocating the individual endowments of a perfectly divisible good among agents with single-peaked preferences. We provide a new concept of fairness, called position-wise envy-freeness, that is compatible with individual rationality. This new concept requires...

A fair division problem with indivisible objects, e.g. jobs, and one divisible good (money) is considered. The individuals consume one object and money. The class of strategy-proof and fair allocation rules is characterized. The allocation rules in the class are like a Vickrey auction bossy and...

In a moneyless market, a non storable, non transferable homogeneous commodity is reallocated between agents with single-peaked preferences. Agents are either suppliers or demanders. Transfers between a supplier and a demander are feasible only if they are linked, and the links form an arbitrary...

A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number of public facilities to be located. We consider public facilities that do not suffer from congestion and are non-excludable. We characterize the class of rules...

We study allocation rules that are robust to coalitional manipulation by transferring, merging, or splitting individual characteristics among coalition partners (e.g. merging or splitting claims in bankruptcy problems). Coalition formation is restricted by an exogenous network (a non-directed...

We consider the problem of allocating several units of an indivisible object among the agents with single-peaked and risk-averse utility functions. We introduce equal probability for the best, and show that the randomized uniform rule is the only randomized rule satisfying strategy-proofness,...