Weighted manipulation for four-candidate Llull is easy

MaRDI QIDQ3457231zbMATH OpenFDO

Authors Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor

Publication date 11 December 2015

Full work available at URL http://ebooks.iospress.nl/volumearticle/6992

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Social choice (91B14)

Recommendations

• A note on the complexity of manipulating weighted Schulze voting
• Algorithms for the coalitional manipulation problem
• New Approximations for Coalitional Manipulation in Scoring Rules
• When are elections with few candidates hard to manipulate?
• Weighted electoral control

Cited in

(4)

• A note on the complexity of manipulating weighted Schulze voting
• Manipulation complexity of same-system runoff elections
• Exact algorithms for weighted and unweighted Borda manipulation problems
• Resilient heuristic aggregation of judgments in the pairwise comparisons method

This page was built for publication: Weighted manipulation for four-candidate Llull is easy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457231)