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:	2014
Authors:	Peters, Hans ; Roy, Souvik ; Sen, Arunava ; Storcken, Ton
Published in:	Journal of Mathematical Economics. - Elsevier, ISSN 0304-4068. - Vol. 52.2014, C, p. 123-127
Publisher:	Elsevier
Subject:	Probabilistic rules \| Strategy-proof \| Single-peaked domain

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

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