Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 123-127 |
Journal | Journal of Mathematical Economics |
Volume | 52 |
DOIs | |
Publication status | Published - 1 Jan 2014 |