Strategyproof Randomized Social Choice for Restricted Sets of Utility Functions
Patrick Lederer

TL;DR
This paper introduces a new concept of $U$-strategyproofness for social decision schemes, analyzing its tradeoffs with decisiveness and efficiency, especially under restricted utility function sets, to improve strategyproofness in social choice.
Contribution
It proposes $U$-strategyproofness, a relaxation of strategyproofness, and analyzes its implications for decisiveness, Condorcet-consistency, and efficiency in social decision schemes.
Findings
$U$-strategyproof SDSs can be fully decisive under certain utility conditions.
$U$-strategyproofness conflicts with Condorcet-consistency under minimal symmetry.
No highly decisive, $U$-strategyproof, ex post efficient SDS exists close to indifferent voters.
Abstract
Social decision schemes (SDSs) map the voters' preferences over multiple alternatives to a probability distribution over these alternatives. In a seminal result, Gibbard (1977) has characterized the set of SDSs that are strategyproof with respect to all utility functions and his result implies that all such SDSs are either unfair to the voters or alternatives, or they require a significant amount of randomization. To circumvent this negative result, we propose the notion of -strategyproofness which postulates that only voters with a utility function in a predefined set cannot manipulate. We then analyze the tradeoff between -strategyproofness and various decisiveness notions that restrict the amount of randomization of SDSs. In particular, we show that if the utility functions in the set value the best alternative much more than other alternatives, there are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
