Probabilistic strategy-proof rules over single-peaked domains

H.J.M. Peters; S. Roy; A. Sen; A.J.A. Storcken

doi:10.1016/j.jmateco.2014.03.008

Probabilistic strategy-proof rules over single-peaked domains

H.J.M. Peters, S. Roy, A. Sen^*, A.J.A. Storcken

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

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.

Original language	English
Pages (from-to)	123-127
Journal	Journal of Mathematical Economics
Volume	52
DOIs	https://doi.org/10.1016/j.jmateco.2014.03.008
Publication status	Published - 1 Jan 2014

Access to Document

10.1016/j.jmateco.2014.03.008

Cite this

@article{656a77b910af46dd81842e2f47ba9970,

title = "Probabilistic strategy-proof rules over single-peaked domains",

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.",

author = "H.J.M. Peters and S. Roy and A. Sen and A.J.A. Storcken",

year = "2014",

month = jan,

day = "1",

doi = "10.1016/j.jmateco.2014.03.008",

language = "English",

volume = "52",

pages = "123--127",

journal = "Journal of Mathematical Economics",

issn = "0304-4068",

publisher = "Elsevier Science",

}

TY - JOUR

T1 - Probabilistic strategy-proof rules over single-peaked domains

AU - Peters, H.J.M.

AU - Roy, S.

AU - Sen, A.

AU - Storcken, A.J.A.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

U2 - 10.1016/j.jmateco.2014.03.008

DO - 10.1016/j.jmateco.2014.03.008

M3 - Article

VL - 52

SP - 123

EP - 127

JO - Journal of Mathematical Economics

JF - Journal of Mathematical Economics

SN - 0304-4068

ER -