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.
|Date of creation:||2013|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +31 (0)43 38 83 830
Web page: http://www.maastrichtuniversity.nl/Email:
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:unm:umagsb:2013040. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Charles Bollen)
If references are entirely missing, you can add them using this form.