Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
From MaRDI portal
Publication:2941740
DOI10.1613/jair.4647zbMath1337.91039OpenAlexW2233988666MaRDI QIDQ2941740
Markus Brill, Hemaspaandra, Lane A., Edith Hemaspaandra, Felix Brandt
Publication date: 25 August 2015
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4647
Related Items (21)
The complexity of online bribery in sequential elections ⋮ The likelihood of single-peaked preferences under classic and new probability distribution assumptions ⋮ Are there any nicely structured preference profiles nearby? ⋮ The complexity of priced control in elections ⋮ Pareto rationalizability by two single-peaked preferences ⋮ The control complexity of \(r\)-Approval: from the single-peaked case to the general case ⋮ A characterization of the single-peaked single-crossing domain ⋮ Group control for consent rules with consecutive qualifications ⋮ The shield that never was: societies with single-peaked preferences are more open to manipulation and control ⋮ Resilient heuristic aggregation of judgments in the pairwise comparisons method ⋮ Structure of single-peaked preferences ⋮ On the likelihood of single-peaked preferences ⋮ Computing kemeny rankings from \(d\)-Euclidean preferences ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ On the complexity of bribery with distance restrictions ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Campaign management under approval-driven voting rules ⋮ Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms ⋮ Parameterized complexity of voter control in multi-peaked elections ⋮ Structured preferences: a literature survey ⋮ Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results
This page was built for publication: Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
