Weak Strategyproofness in Randomized Social Choice

Authors: Felix Brandt, Patrick Lederer

AAAI 2025 | Venue PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical In this paper, we study weak strategyproofness, which deems a manipulation successful if it increases the voter s expected utility for all utility functions consistent with his ordinal preferences. We show how to systematically design attractive, weakly strategyproof social decision schemes (SDSs) and explore their limitations for both strict and weak preferences. In particular, for strict preferences, we show that there are weakly strategyproof SDSs that are either ex post efficient or Condorcetconsistent, while neither even-chance SDSs nor pairwise SDSs satisfy both properties and weak strategyproofness at the same time. By contrast, for the case of weak preferences, we discuss two sweeping impossibility results that preclude the existence of appealing weakly strategyproof SDSs.
Researcher Affiliation Academia 1Technical University of Munich 2UNSW Sydney EMAIL, EMAIL
Pseudocode No The paper includes 'Proof sketch' sections for its theorems but does not contain any explicitly labeled 'Pseudocode' or 'Algorithm' blocks, nor does it present structured steps in a code-like format.
Open Source Code No The paper does not contain any explicit statements about releasing source code for the methodology described. It primarily focuses on theoretical results and proofs.
Open Datasets No The paper is theoretical and does not describe experiments that use specific datasets. Therefore, no information about publicly available datasets is provided.
Dataset Splits No The paper is theoretical and does not conduct experiments on datasets, thus there is no mention of dataset splits for training, validation, or testing.
Hardware Specification No The paper is theoretical and presents mathematical proofs and characterizations, rather than experimental results that would require specific hardware. Therefore, no hardware specifications are mentioned.
Software Dependencies No The paper focuses on theoretical results and does not describe any computational implementation or experiments that would necessitate specific software dependencies with version numbers.
Experiment Setup No The paper is theoretical and does not describe any experimental setup, hyperparameters, or system-level training settings.