Complexity of optimal lobbying in threshold aggregation

DOI10.1007/978-3-319-23114-3_23MaRDI QIDQ3449545zbMATH OpenOpenAlexFDO

Authors Ilan Nehama

Publication date 4 November 2015

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

Full work available at URL http://ratio.huji.ac.il/sites/default/files/publications/dp642.pdf

zbMATH Keywords

optimal lobbyingthreshold functiontime complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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
• On complexity of lobbying in multiple referenda
• On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time

Cited in

(5)

• The complexity of probabilistic lobbying
• On complexity of lobbying in multiple referenda
• The Complexity of Probabilistic Lobbying
• On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
• A Multivariate Complexity Analysis of Lobbying in Multiple Referenda

This page was built for publication: Complexity of optimal lobbying in threshold aggregation

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