Monotone Strategyproofness

Games and Economic Behavior 98 (2016): 68–77

22 Pages Posted: 18 Jan 2013 Last revised: 4 Jul 2019

See all articles by Guillaume Haeringer

Guillaume Haeringer

CUNY Baruch College

Hanna Halaburda

New York University (NYU) - Leonard N. Stern School of Business

Date Written: June 6, 2016

Abstract

We propose a way to compare the extent of preference misrepresentation between two strategies. We define a preference revelation mechanism to be monotone strategyproof if declaring a “more truthful” preference ordering 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, misrepresentations, dominant strategy

JEL Classification: C72, D41

Suggested Citation

Haeringer, Guillaume and Halaburda, Hanna, Monotone Strategyproofness (June 6, 2016). Games and Economic Behavior 98 (2016): 68–77, Available at SSRN: https://ssrn.com/abstract=2202176 or http://dx.doi.org/10.2139/ssrn.2202176

Guillaume Haeringer

CUNY Baruch College ( email )

17 Lexington Avenue
New York, NY 10021
United States

Hanna Halaburda (Contact Author)

New York University (NYU) - Leonard N. Stern School of Business ( email )

44 West 4th Street
New York, NY NY 10012
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
53
Abstract Views
615
rank
473,841
PlumX Metrics