Research map / Learning theory and algorithms / Submodular and game algorithms
Complexity of Shift Bribery in Committee Elections
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Approximation and Hardness of Shift-Bribery (AAAI 2019 · similarity 0.91)
- Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives (AAAI 2016 · similarity 0.89)
- Algorithms for Structured Elections Under Thiele Voting Rules (AAAI 2026 · similarity 0.89)
- Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates (AAAI 2016 · similarity 0.89)
- Maintaining Proportional Committees with Dynamic Candidate Sets (ICML 2025 · similarity 0.87)
- Multi-Winner Reconfiguration (NeurIPS 2024 · similarity 0.87)
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.