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.

MoreLess

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

More details

Extent:	application/pdf
Series:	Research Memorandum.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series Research Memorandum Number 040
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010856561