The complexity of probabilistic lobbying
From MaRDI portal
Publication:1662102
DOI10.1016/j.disopt.2013.10.003zbMath1506.91049WikidataQ59864911 ScholiaQ59864911MaRDI QIDQ1662102
Henning Fernau, Judy Goldsmith, Jörg Rothe, Daniel Binkele-Raible, Gábor Erdélyi, Nicholas Mattei
Publication date: 17 August 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2013.10.003
68Q25: Analysis of algorithms and problem complexity
91B12: Voting theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
91B14: Social choice
Uses Software