scientific article
From MaRDI portal
Publication:3624050
zbMath1165.91362MaRDI QIDQ3624050
Jeffrey S. Rosenschein, Ariel D. Procaccia
Publication date: 28 April 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners ⋮ Algorithms for the coalitional manipulation problem ⋮ Generalized juntas and NP-hard sets ⋮ The learnability of voting rules ⋮ Manipulative elicitation -- a new attack on elections with incomplete preferences ⋮ Dichotomy for voting systems ⋮ A quantitative Gobbard-Satterthwaite theorem without neutrality ⋮ The complexity of probabilistic lobbying ⋮ Normalized range voting broadly resists control ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ The shield that never was: societies with single-peaked preferences are more open to manipulation and control ⋮ On the complexity of achieving proportional representation ⋮ On the complexity of bribery and manipulation in tournaments with uncertain information ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ Manipulation can be hard in tractable voting systems even for constant-sized coalitions ⋮ Is computational complexity a barrier to manipulation? ⋮ The complexity of manipulative attacks in nearly single-peaked electorates ⋮ Voting Procedures, Complexity of ⋮ Control complexity in Bucklin and fallback voting: a theoretical analysis ⋮ Control complexity in Bucklin and fallback voting: an experimental analysis ⋮ The opacity of backbones ⋮ Hybrid Elections Broaden Complexity-Theoretic Resistance to 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
