Probabilistic strategy-proof rules over single-peaked domains

Hans Peters, S. Roy, Arunava Sen and A.J.A. Storcken
Additional contact information
S. Roy: Quantitative Economics
A.J.A. Storcken: Quantitative Economics
Authors registered in the RePEc Author Service: Shovon Roy and Souvik Roy

No 40, Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE)

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.

Date: 2013-01-01
New Economics Papers: this item is included in nep-gth and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://cris.maastrichtuniversity.nl/ws/files/7057 ... 9c31fd5-ASSET1.0.pdf (application/pdf)

Related works:
Journal Article: Probabilistic strategy-proof rules over single-peaked domains (2014)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:unm:umagsb:2013040

DOI: 10.26481/umagsb.2013040

Access Statistics for this paper

More papers in Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE) Contact information at EDIRC.
Bibliographic data for series maintained by Andrea Willems () and Angie Figueroa Alarcon ().