All Sequential Allotment Rules Are Obviously Strategy-proof

ARRIBILLAGA, R. PABLO; JORDI MASSO; ALEJANDRO NEME

Congreso; VIII Congreso de Matemática Aplicada, Computacional e Industrial; 2021

For division problems with single-peaked preferences (Sprumont, 1991) we show that all sequential allotment rules, identi…ed by Barberà, Jackson and Neme (1997) as the class of all strategy-proof, e¢ cient 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.