A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
From MaRDI portal
Publication:5494853
DOI10.1613/jair.4285zbMath1342.91011OpenAlexW2151508551MaRDI QIDQ5494853
Jiehua Chen, Robert Bredereck, Stefan Kratsch, Ondřej Suchý, Sepp Hartung, Rolf Niedermeier, Gerhard J. Woeginger
Publication date: 30 July 2014
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4285
Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Resolute control: forbidding candidates from winning an election is hard ⋮ Prices matter for the parameterized complexity of shift bribery ⋮ Complexity of control in judgment aggregation for uniform premise-based quota rules ⋮ Combinatorial \(n\)-fold integer programming and applications
This page was built for publication: A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
