Author:
Baumeister Dorothea,Neveling Marc,Roos Magnus,Rothe Jörg,Schend Lena,Weishaupt Robin,Xia Lirong
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science,General Computer Science
Reference63 articles.
1. Probabilistic possible winner determination;Bachrach,2010
2. How hard is it to control an election?;Bartholdi;Math. Comput. Model.,1992
3. Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules;Baumeister;Inf. Process. Lett.,2012
4. Computational complexity of two variants of the possible winner problem;Baumeister,2011
5. Campaigns for lazy voters: Truncated ballots;Baumeister,2012
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hardness of candidate nomination;Autonomous Agents and Multi-Agent Systems;2023-08-16
2. Complexity of Conformant Election Manipulation;Fundamentals of Computation Theory;2023