More Natural Models of Electoral Control by Partition

DOI10.1007/978-3-319-23114-3_24zbMath1405.91151arXiv1410.2652OpenAlexW1786096394MaRDI QIDQ3449546

Gábor Erdélyi, Edith Hemaspaandra, Hemaspaandra, Lane A.

Publication date: 4 November 2015

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

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

zbMATH Keywords

complexityelectionspartition modelscontrol attacks

Mathematics Subject Classification ID

Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (11)

Algorithms for gerrymandering over graphs ⋮ Optimal defense against election control by deleting voter groups ⋮ Constraint-based electoral districting using a new compactness measure: an application to Portugal ⋮ How hard is safe bribery? ⋮ Priced gerrymandering ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Frugal bribery in voting ⋮ Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections ⋮ A parameterized perspective on protecting elections ⋮ The distortion of distributed voting ⋮ Parameterized complexity of voter control in multi-peaked elections

This page was built for publication: More Natural Models of Electoral Control by Partition