scientific article
From MaRDI portal
Publication:3624161
zbMath1165.91361MaRDI QIDQ3624161
Jeffrey S. Rosenschein, Ariel D. Procaccia, Reshef Meir, Aviv Zohar
Publication date: 28 April 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Resolute control: forbidding candidates from winning an election is hard ⋮ The complexity of priced control in elections ⋮ Justified representation in approval-based committee voting ⋮ The complexity of probabilistic lobbying ⋮ Manipulability of consular election rules ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ Group control for consent rules with consecutive qualifications ⋮ Strategic voting in negotiating teams ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ Reallocating multiple facilities on the line ⋮ Parameterized complexity of control problems in Maximin election ⋮ Control complexity in Bucklin and fallback voting: a theoretical analysis ⋮ The give-up problem for blocked regional lists with multi-winners ⋮ Parameterized computational complexity of Dodgson and Young elections ⋮ Preference elicitation and robust winner determination for single- and multi-winner social choice ⋮ Hybrid Elections Broaden Complexity-Theoretic Resistance to Control ⋮ Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control ⋮ Anyone but him: the complexity of precluding an alternative ⋮ Parameterized computational complexity of control problems in voting systems ⋮ Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers ⋮ Parameterized complexity of candidate control in elections and related digraph problems ⋮ Parameterized Complexity of Control and Bribery for d-Approval Elections ⋮ Combinatorial voter control in elections ⋮ Parameterized complexity of control and bribery for \(d\)-approval elections
Uses Software
