On complexity of lobbying in multiple referenda

DOI10.1007/S10058-007-0028-1MaRDI QIDQ2463791zbMATH OpenOpenAlexWikidataFDO

Authors Robin Christian, Michael R. Fellows, Frances Rosamond, Arkadii Slinko

Publication date 6 December 2007

Published in Review of Economic Design (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1959.13/29767

zbMATH Keywords

lobbyingparametrized complexityreferendum

Mathematics Subject Classification ID

Voting theory (91B12) History, political science (91F10)

Recommendations

• A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
• The complexity of probabilistic lobbying
• The Complexity of Probabilistic Lobbying
• Complexity of optimal lobbying in threshold aggregation
• On the complexity of achieving proportional representation
• Complexity of strategic behavior in multi-winner elections
• Characterizing referenda with quorums via strategy-proofness
• Complexity of manipulative actions when voting with ties
• Pareto efficiency in multiple referendum
• Strategic voting in repeated referenda

Cites work

• A Richer Understanding of the Complexity of Election Systems
• Exact analysis of Dodgson elections
• Exact complexity of the winner problem for Young elections
• How hard is it to control an election?
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1759396 (Why is no real title available?)
• New directions in cryptography
• On complexity of lobbying in multiple referenda
• Recognizing majority-rule equilibrium in spatial voting games
• Single transferable vote resists strategic voting
• The complexity of Kemeny elections
• The computational difficulty of manipulating an election
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(26)

• Fixed-parameter algorithms for Kemeny rankings
• Parameterized complexity of candidate control in elections and related digraph problems
• The complexity of probabilistic lobbying
• Multivariate complexity analysis of Swap Bribery
• Complexity of control in judgment aggregation for uniform premise-based quota rules
• Approximation and hardness of shift-bribery
• Parameterized computational complexity of Dodgson and Young elections
• 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
• Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
• Multivariate complexity analysis of swap bribery
• On the hardness of bribery variants in voting with CP-nets
• Complexity of optimal lobbying in threshold aggregation
• Parameterized Computational Complexity of Dodgson and Young Elections
• The Complexity of Probabilistic Lobbying
• Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
• Voting procedures, complexity of
• 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 Candidate Control in Elections and Related Digraph Problems
• Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas
• Parameterized complexity of control problems in Maximin election
• A simple algorithm for combinatorial n-fold ILPs using the Steinitz lemma
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules

This page was built for publication: On complexity of lobbying in multiple referenda

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