EconPapers    
Economics at your fingertips  
 

Incentives in Social Decision Schemes with Pairwise Comparison Preferences

Felix Brandt, Patrick Lederer and Warut Suksompong

Papers from arXiv.org

Abstract: Social decision schemes (SDSs) map the ordinal preferences of individual voters over multiple alternatives to a probability distribution over the alternatives. In order to study the axiomatic properties of SDSs, we lift preferences over alternatives to preferences over lotteries using the natural -- but little understood -- pairwise comparison (PC) preference extension. This extension postulates that one lottery is preferred to another if the former is more likely to return a preferred outcome. We settle three open questions raised by Brandt (2017): (i) there is no Condorcet-consistent SDS that satisfies PC-strategyproofness; (ii) there is no anonymous and neutral SDS that satisfies PC-efficiency and PC-strategyproofness; and (iii) there is no anonymous and neutral SDS that satisfies PC-efficiency and strict PC-participation. All three impossibilities require $m\geq 4$ alternatives and turn into possibilities when $m\leq 3$. We furthermore settle an open problem raised by Aziz et al. (2015) by showing that no path of PC-improvements originating from an inefficient lottery may lead to a PC-efficient lottery.

Date: 2022-04, Revised 2024-08
New Economics Papers: this item is included in nep-des, nep-mic and nep-upt
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Games and Economic Behavior, 142:266-291 (2023)

Downloads: (external link)
http://arxiv.org/pdf/2204.12436 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2204.12436

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators (help@arxiv.org).

 
Page updated 2025-03-19
Handle: RePEc:arx:papers:2204.12436