On the relation between Preference Reversal and Strategy-Proofness
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.
Code (0)
등록된 구현이 없습니다.
Tasks
RelationSimilar Papers 제목 키워드 기반
Compatibility between Stability and Strategy-Proofness: A Single-Peaked Preferences Investigation
In two-sided matching markets, ensuring both stability and strategy-proofness poses a significant challenge; it is impossible when agents' preferences are unrestricted. But what if agents' preferences have specific restr…
Obvious Strategy-proofness with Respect to a Partition
We define and study obvious strategy-proofness with respect to a partition of the set of agents. It encompasses strategy-proofness as a special case when the partition is the coarsest one and obvious strategy-proofness w…
Equivalence between individual and group strategy-proofness under stability
This paper studies the (group) strategy-proofness aspect of two-sided matching markets under stability. For a one-to-one matching market, we show an equivalence between individual and group strategy-proofness under stabi…
Characterizing the Top Cycle via Strategyproofness
Gibbard and Satterthwaite have shown that the only single-valued social choice functions (SCFs) that satisfy non-imposition (i.e., the function's range coincides with its codomain) and strategyproofness (i.e., voters are…
Pareto Optimality and Strategy Proofness in Group Argument Evaluation (Extended Version)
An inconsistent knowledge base can be abstracted as a set of arguments and a defeat relation among them. There can be more than one consistent way to evaluate such an argumentation graph. Collective argument evaluation i…