scientific article; zbMATH DE number 6902517
From MaRDI portal
Publication:4576180
DOI10.3233/978-1-61499-672-9-277zbMath1396.91133MaRDI QIDQ4576180
Publication date: 12 July 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters ⋮ Optimal defense against election control by deleting voter groups ⋮ Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections ⋮ A parameterized perspective on protecting elections
This page was built for publication: