The Complexity of Probabilistic Lobbying
From MaRDI portal
Publication:3645307
Recommendations
Cited in
(10)- Studies in Computational Aspects of Voting
- Geometric vulnerability of democratic institutions against lobbying: a sociophysics approach
- On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity?
- Complexity of optimal lobbying in threshold aggregation
- The complexity of probabilistic lobbying
- Parameterized complexity of control problems in Maximin election
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
- Bribery in voting with CP-nets
- On complexity of lobbying in multiple referenda
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)