The Complexity of Probabilistic Lobbying

DOI10.1007/978-3-642-04428-1_8MaRDI QIDQ3645307zbMATH OpenOpenAlexFDO

Authors Gábor Erdélyi, Henning Fernau, J. Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe

Publication date 17 November 2009

Published in Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04428-1_8

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Recommendations

• The complexity of probabilistic lobbying
• A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
• On complexity of lobbying in multiple referenda
• Complexity of optimal lobbying in threshold aggregation
• How hard is bribery in elections?

Cited in

(10)

• The complexity of probabilistic lobbying
• Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity?
• Bribery in voting with CP-nets
• On complexity of lobbying in multiple referenda
• Studies in Computational Aspects of Voting
• Geometric vulnerability of democratic institutions against lobbying: a sociophysics approach
• Complexity of optimal lobbying in threshold aggregation
• On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
• A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
• Parameterized complexity of control problems in Maximin election

This page was built for publication: The Complexity of Probabilistic Lobbying

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3645307)