Online voter control in sequential elections

zbMATH Open1327.68119arXiv1203.0411MaRDI QIDQ3457243FDOQ3457243

Authors: Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe 

Publication date: 11 December 2015

Full work available at URL: https://arxiv.org/abs/1203.0411

Recommendations

• The complexity of controlling candidate-sequential elections
• The complexity of online manipulation of sequential elections
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
• The complexity of online bribery in sequential elections
• On the computational complexity of variants of combinatorial voter control in elections

Mathematics Subject Classification ID

Social choice (91B14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (6)

• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
• The complexity of online manipulation of sequential elections
• Election control through social influence with voters' uncertainty
• A parameterized perspective on protecting elections
• Control complexity in Bucklin and fallback voting: a theoretical analysis
• The complexity of controlling candidate-sequential elections

This page was built for publication: Online voter control in sequential elections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457243)