scientific article; zbMATH DE number 5764882

MaRDI QIDQ3579475zbMATH OpenFDO

Authors Michael Zuckerman, Ariel D. Procaccia, Jeffrey S. Rosenschein

Publication date 6 August 2010

Mathematics Subject Classification ID

Social choice (91B14) Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• The learnability of voting rules
• Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
• Computational complexity of manipulation: a survey
• Is computational complexity a barrier to manipulation?
• Binary linear programming solutions and non-approximability for control problems in voting systems

This page was built for publication:

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