scientific article
From MaRDI portal
Publication:3457243
zbMath1327.68119arXiv1203.0411MaRDI QIDQ3457243
Hemaspaandra, Lane A., Edith Hemaspaandra, Jörg Rothe
Publication date: 11 December 2015
Full work available at URL: https://arxiv.org/abs/1203.0411
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)
Related Items (4)
The complexity of online manipulation of sequential elections ⋮ The complexity of controlling candidate-sequential elections ⋮ Control complexity in Bucklin and fallback voting: a theoretical analysis ⋮ A parameterized perspective on protecting elections
This page was built for publication:
