All Sequential Allotment Rules Are Obviously Strategy-proof

JORDI MASSO; ALEJANDRO NEME; R. PABLO ARRIBILLAGA

Workshop; Anual SAET conference; 2022

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 strategyproofness is in general more restrictive than strategy-proofness, this is not the case in this setting.