On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time

DOI10.1007/978-3-540-74240-1_26zbMath1135.91343OpenAlexW1497188755MaRDI QIDQ5444969

Hemaspaandra, Lane A., Gábor Erdélyi, Jörg Rothe, Holger Spakowski

Publication date: 26 February 2008

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1802/4044

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Related Items (5)

Guarantees for the success frequency of an algorithm for finding Dodgson-election winners ⋮ Algorithms for the coalitional manipulation problem ⋮ Copeland Voting Fully Resists Constructive Control ⋮ Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control ⋮ Parameterized complexity of candidate control in elections and related digraph problems

This page was built for publication: On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time