Abstract
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 the case in this setting.
Funding Information
  • Ministerio de Ciencia e Innovación
  • Universidad Nacional de San Luis
  • Consejo Nacional de Investigaciones Científicas y Técnicas
  • Agencia Nacional de Promoción de la Investigación, el Desarrollo Tecnológico y la Innovación
  • Agencia Estatal de Investigación
  • Generalitat de Catalunya

This publication has 23 references indexed in Scilit: