Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the relation between Preference Reversal and Strategy-Proofness (2104.10205v2)

Published 20 Apr 2021 in econ.TH

Abstract: We analyze the relation between strategy-proofness and preference reversal in the case that agents may declare indifference. Interestingly, Berga and Moreno (2020), have recently derived preference reversal from group strategy-proofness of social choice functions on strict preferences domains if the range has no more than three elements. We extend this result and at the same time simplify it. Our analysis points out the role of individual strategy-proofness in deriving the preference reversal property, giving back to the latter its original individual nature (cfr. Eliaz, 2004). Moreover, we show that the difficulties Berga and Moreno highlighted relaxing the assumption on the cardinality of the range, disappear under a proper assumption on the domain. We introduce the concept of complete sets of preferences and show that individual strategy-proofness is sufficient to obtain the preference reversal property when the agents' feasible set of orderings is complete. This covers interesting cases like single peaked preferences, rich domains admitting regular social choice functions, and universal domains. The fact that we use individual rather than group strategy-proofness, allows to get immediately some of the known, and some new, equivalences between individual and group strategy-proofness. Finally, we show that group strategy-proofness is only really needed to obtain preference reversal if there are infinitely many voters.

Summary

We haven't generated a summary for this paper yet.