Probabilistic Strategy-Proof Rules over Single-Peaked Domains
AbstractIt 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Maastricht : GSBE, Graduate School of Business and Economics in its series Research Memorandum with number 040.
Date of creation: 2013
Date of revision:
Contact details of provider:
Web page: http://www.maastrichtuniversity.nl/web/UMPublications.htm
Other versions of this item:
- Storcken A.J.A. & Peters H.J.M. & Roy S. & Sen A., 2013. "Probabilistic Strategy-Proof Rules over Single-Peaked Domains," Research Memorandum 040, Maastricht University, Graduate School of Business and Economics (GSBE).
- NEP-ALL-2013-10-18 (All new papers)
- NEP-GTH-2013-10-18 (Game Theory)
- NEP-MIC-2013-10-18 (Microeconomics)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.