![](https://d3ilqtpdwi981i.cloudfront.net/5O5QBhpA6wF5VzR2UzE1FySkF70=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/b9/93/4d/b9934daf-d877-4e97-8a3a-33232c60494a/thumbnail_BPFile_object.jpg)
Article
Monotone Strategyproofness
Games and Economic Behavior
(2016)
Abstract
We propose a way to compare the extent of preference misrepresentation between two strategies. We define a mechanism to be monotone strategyproof when declaring a ``more truthful" preference ordering in the mechanism dominates--with respect to the true preferences--declaring a less truthful preference ordering. Our main result states that a mechanism is strategyproof if, and only if, it is monotone strategyproof. This result holds for any deterministic social choice function on any domain; for probabilistic social choice functions it holds under a mild assumption on the domain.
Keywords
- strategyproofness,
- Kemeny sets,
- truthful,
- dominant strategy
Disciplines
Publication Date
2016
Citation Information
Guillaume Haeringer and Hanna Halaburda, "Monotone Strategyproofness," Games and Economic Behavior 98 (2016) 68–77