We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists...

The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with single-peaked preferences on an exogenously given interval of feasible allotments. We characterize axiomatically the family of extended...

The division problem consists of allocating a given amount of an homogeneous and perfectly divisible good among a group of agents with single-peaked preferences on the set of their potential shares. A rule proposes a vector of shares for each division problem. The literature has implicitly...