All Sequential Allotment Rules Are Obviously Strategy-Proof

• Authors: Jordi Massó.
• BSE Working Paper: 110581 | July 19
• Keywords: Single-peaked preferences , Division Problem , obvious strategy-proofness , sequential allotment rules
• JEL codes: D71
• Single-peaked preferences
• Division Problem
• obvious strategy-proofness
• sequential allotment rules

For the division problem with single-peaked preferences (Sprumont, 1991) we show that all sequential allotment rules, identified by Barberà, Jackson and Neme (1997) as the class of strategy-proof, efficient and replacement monotonic rules, are also obviously strategy-proof. Although obvious strategy-proofness is in general more restrictive than strategy-proofness, this is not the case in this setting.