The Complexity of Probabilistic Lobbying

DOI10.1007/978-3-642-04428-1_8zbMath1260.91081OpenAlexW2174287115MaRDI QIDQ3645307

Judy Goldsmith, Gábor Erdélyi, Henning Fernau, Daniel Raible, Nicholas Mattei, 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

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

Related Items (5)

Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? ⋮ Studies in Computational Aspects of Voting ⋮ The complexity of probabilistic lobbying ⋮ Bribery in voting with CP-nets ⋮ Parameterized complexity of control problems in Maximin election

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