@techreport{0000b520a77d4c678776e413f763284f,
title = "Probabilistic strategy-proof rules over single-peaked domains",
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.",
author = "H.J.M. Peters and S. Roy and A. Sen and A.J.A. Storcken",
year = "2013",
month = jan,
day = "1",
doi = "10.26481/umagsb.2013040",
language = "English",
series = "GSBE Research Memoranda",
publisher = "Maastricht University, Graduate School of Business and Economics",
number = "040",
address = "Netherlands",
type = "WorkingPaper",
institution = "Maastricht University, Graduate School of Business and Economics",
}