scientific article

zbMath1235.91056arXiv1401.4602MaRDI QIDQ3112639

Piotr Faliszewski, Edith Elkind, Arkadii M. Slinko

Publication date: 12 January 2012

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Related Items (14)

The complexity of priced control in elections ⋮ Studies in Computational Aspects of Voting ⋮ Solving hard control problems in voting systems via integer programming ⋮ Complexity of control in judgment aggregation for uniform premise-based quota rules ⋮ The possible winner with uncertain weights problem ⋮ New candidates welcome! Possible winners with respect to the addition of new candidates ⋮ Manipulation can be hard in tractable voting systems even for constant-sized coalitions ⋮ The complexity of manipulative attacks in nearly single-peaked electorates ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Consistency of scoring rules: a reinvestigation of composition-consistency ⋮ Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections ⋮ Exact algorithms for weighted and unweighted Borda manipulation problems ⋮ Multiple votes, multiple candidacies and polarization ⋮ Condorcet domains, median graphs and the single-crossing property

This page was built for publication: