Computational Complexity of Voting Systems
Summary
The computational complexity of voting systems examines the algorithmic effort required to determine outcomes, resist strategic interventions and safeguard democratic processes. Central to this field is the analysis of winner determination under various voting rules, including plurality, Borda and Condorcet methods. Beyond mere result computation, researchers study how difficult it is for an external agent to influence an election through actions such as adding or deleting candidates or voters (control), or persuading electors to misreport preferences (manipulation and bribery). Many natural voting systems are NP-hard to manipulate or control, indicating that in the worst case no efficient algorithm exists. Recent work has extended this understanding through parameterised complexity, identifying conditions under which seemingly intractable problems admit efficient solutions when key parameters, such as the number of voters or candidate subsets, remain small. These insights illuminate global implications, from the design of robust electoral protocols to the development of real-world safeguards against undue influence. Concrete examples include fixed-parameter algorithms for limited-scale lobbying in referenda and hardness results that affirm the resistance of iterative voting methods to strategic shifts.
Research from Nature Portfolio
No recent Nature Portfolio content available.
Computational Complexity of Voting Systems publication trend
The graph below shows the total number of articles in computational complexity of voting systems across all publications each year (not limited to Nature Index journals).
Technical terms
NP-hardness: A classification indicating that a problem is at least as hard as the hardest problems in NP, so that no polynomial-time algorithm is known.
Fixed-parameter tractable (FPT): Denotes problems that can be solved in time f(k)·n^O(1), where n is input size and k a chosen parameter, making computation feasible for small k.
Parameterized complexity: A framework analysing algorithmic complexity with respect to both input size and auxiliary parameters, to identify tractable special cases.
Electoral control: Strategic modifications to an election structure, such as adding or deleting candidates or voters, aimed at altering the outcome.
Bribery: Attempts to influence electors by changing their preference orders at a cost, modelled to assess the complexity of such interventions.
Manipulation: Strategic voting by one or more participants who misrepresent their true preferences to secure a favourable outcome.
References
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. Journal of Artificial Intelligence Research (2014).
- Complexity of shift bribery for iterative voting rules. Annals of Mathematics and Artificial Intelligence (2022).
- Parameterized complexity of candidate nomination for elections based on positional scoring rules. Autonomous Agents and Multi-Agent Systems (2024).
- Resolute control: Forbidding candidates from winning an election is hard. Theoretical Computer Science (2022).
About these summaries
This Nature Research Intelligence Topic summary is created with the cited references and a large language model. We take care to ground generated text with facts, and have systems in place to gain human feedback on the overall quality of the process in line with our AI principles. We strive to create accurate and useful summaries for people unfamiliar with the research topic and that supports this goal. These pages are a beta release and will be updated as we learn how best to help people gain value from a research topic summary.
Turn complex research questions into confident strategic decisions
When you're under pressure to set direction, justify investment, or understand your competitive position, you need more than raw data — you need trusted insights you can act on.
Benchmark your performance against global peers using robust, methodologically sound analysis.
Combine quantitative metrics with qualitative expert insight to uncover strengths, gaps and emerging opportunities.
Gain tailored, decision-ready recommendations aligned to your strategic priorities.
Talk to us to learn more about our data dashboards and bespoke strategy reports.
Grow research skills, confidence and careers with training built for every stage of the research lifecycle.
Developed with Nature Portfolio journal Editors and internationally renowned experts. Discover three ways to learn:
Self-paced, online courses in convenient bite-sized units, covering key skills across scientific writing, publishing, grant writing, data analysis, and more.
Expert trainer-led workshops with hands-on exercises and real-time feedback across core research skills, delivered via interactive group sessions.
Editor-led workshops combining core principles in writing and publishing, personalised 1:1 feedback from Nature Portfolio Editors and hands-on exercises.
Explore course catalogues and workshop agendas, enquire about the options or request institutional pricing.