Probabilistic Strategy-Proof Rules over Single-Peaked Domains
A.J.A. Storcken, Hans J. M. Peters, S. Roy, Sen A. · RePEc: Research Papers in Economics · 2013
It is proved that every strategy-proof, peaks-only or unanimous, probabilistic rule defined over a minimally rich domain of single-peaked preferences is a probability mixture of strategy-proof, peaks-only or unanimous, deterministic rules over the same domain. The proof employs Farkas Lemma and the max-flow min-cut theorem for capacitated networks.