atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Weak Strategyproofness in Randomized Social Choice

AAAI 2025 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Studies weak strategyproofness (manipulation counts only if it helps for all utility functions consistent with ordinal preferences) for social decision schemes, giving possibility results (score-based SDSs, tops-only characterizations) and impossibility results for strict and weak preferences.

Problem

Gibbard's random dictatorship theorem relies on strong strategyproofness, which is very demanding; the question is which randomized voting rules (SDSs) remain strategyproof under a weaker notion where only manipulations successful for all consistent utilities count.

Approach

Defines weak strategyproofness via comparable lotteries only, introduces a broad class of score-based SDSs (with balancedness and localizedness conditions) proven weakly strategyproof, and characterizes weakly strategyproof tops-only and even-chance SDSs, revealing a sharp contrast between strict and weak preferences.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a score-based SDSSDSs on strict preferences · Strict preferencesweak strategyproofnessHelped
Use the Condorcet rule or a Copeland score variant with a Condorcet-winner scoreSDSs on strict preferences · Strict preferencesCondorcet-consistencyHelped
Require an even-chance SDSWeakly strategyproof SDSs with strict preferences · Strict preferences; m≥5, n≥5 oddsimultaneous Condorcet-consistency and ex post efficiencyHurt
Restrict the SDS to be pairwise and neutralWeakly strategyproof SDSs on strict preferences · Strict preferences; m≥5ex post efficiencyHurt
Require anonymity and neutralityWeakly strategyproof SDSs on weak preferences · Weak preferences; n≥4, m≥4ex ante efficiencyHurt
Require ex post efficiency and weak strategyproofness while restricting to even-chance SDSsSDSs on weak preferences · Weak preferences; m≥3, n≥3dictatorial or bidictatorial outcomeHurt

Surprising findings

Limitations

Experimental setup

Baselines: random dictatorship omninomination rule Condorcet rule random serial dictatorship

Builds on: Gibbard random dictatorship theorem stochastic dominance for lotteries even-chance strategyproofness

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy