Research map / Learning theory and algorithms / Submodular and game algorithms
Optimal Aggregation of Uncertain Preferences
Ariel Procaccia, Nisarg Shah
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| ignore voter uncertainty and aggregate only central rankings, instead of aggregating uncertain votes | Kemeny aggregation · Preflib real preference profiles with simulated Mallows uncertainty | expected sum of Kendall tau distances (h): up to 1% increase in h | Hurt |
| ignore voter uncertainty and aggregate only central rankings | Kemeny aggregation · Preflib profiles | alternative objective (h minus unavoidable feedback) | Hurt |
Closest papers by meaning
- Selective Preference Aggregation (ICML 2025 · similarity 0.89)
- Independence of Irrelevant Alternatives under the Lens of Pairwise Distortion (AAAI 2024 · similarity 0.88)
- Computing Voting Rules with Improvement Feedback (ICML 2025 · similarity 0.86)
- Can a Few Decide for Many? The Metric Distortion of Sortition (ICML 2024 · similarity 0.86)
- Aggregating Quantitative Relative Judgments: From Social Choice to Ranking Prediction (NeurIPS 2024 · similarity 0.86)
- Policy Aggregation (NeurIPS 2024 · similarity 0.85)
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.
