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

For division problems with single-peaked preferences, we show that all sequential allotment rules, a large subfamily of strategy-proof and efficient rules, are also obviously strategy-proof. Although obvious strategy-proofness is, in general, more restrictive than strategy-proofness, this is not...