Evaluationwise strategy-proofness

B-Tier
Journal: Games and Economic Behavior
Year: 2017
Volume: 106
Issue: C
Pages: 227-238

Authors (3)

Erdamar, Bora (not in RePEc) Sanver, M. Remzi (Université Paris-Dauphine (Par...) Sato, Shin (not in RePEc)

Score contribution per author:

0.670 = (α=2.01 / 3 authors) × 1.0x B-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

We consider manipulation of collective decision making rules in a framework where voters not only rank candidates but also evaluate them as “acceptable” or “unacceptable”. In this richer informational setting, we adopt a new notion of strategy-proofness, called evaluationwise strategy-proofness, where incentives of manipulation exist if and only if a voter can replace an outcome which he finds unacceptable with an acceptable one. Evaluationwise strategy-proofness is weaker than strategy-proofness. However, we establish the prevalence of a logical incompatibility between evaluationwise strategy-proofness, anonymity and efficiency. On the other hand, we show possibility results when either anonymity or efficiency is weakened.

Technical Details

RePEc Handle
repec:eee:gamebe:v:106:y:2017:i:c:p:227-238
Journal Field
Theory
Author Count
3
Added to Database
2026-01-29