Complexity of Optimal Lobbying in Threshold Aggregation

DOI10.1007/978-3-319-23114-3_23zbMath1405.91158OpenAlexW3138927480MaRDI QIDQ3449545

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

time complexitythreshold functionoptimal lobbying

Mathematics Subject Classification ID

Voting theory (91B12) History, political science (91F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Complexity of Optimal Lobbying in Threshold Aggregation