Probabilistic strategy-proof rules over single-peaked domains

Hans Peters, Souvik Roy (), Arunava Sen and Ton Storcken

Journal of Mathematical Economics, 2014, vol. 52, issue C, 123-127

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.

Keywords: Probabilistic rules; Strategy-proof; Single-peaked domain (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (30)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406814000470
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Probabilistic strategy-proof rules over single-peaked domains (2013)
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:eee:mateco:v:52:y:2014:i:c:p:123-127

DOI: 10.1016/j.jmateco.2014.03.008

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().