Probabilistic Strategy-Proof Rules over Single-Peaked Domains
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.
Year of publication: |
2013
|
---|---|
Authors: | Storcken A.J.A. ; Peters H.J.M. ; Roy S. ; Sen A. |
Institutions: | Graduate School of Business and Economics (GSBE), School of Business and Economics |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Strategy-proof location of public bads in a two-country model
Lahiri A., (2015)
-
Measuring polarization of preferences
Can B., (2014)
-
A re-characterization of the Kemeny distance
Storcken A.J.A., (2013)
- More ...