On the parameterized complexity of party nominations

DOI10.1007/978-3-030-31489-7_8MaRDI QIDQ2290374zbMATH OpenOpenAlexFDO

Authors Neeldhara Misra

Publication date 27 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-31489-7_8

zbMATH Keywords

candidate electionNP-hardnessparty nominationsvoting rule

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Voting theory (91B12)

Recommendations

• Parameterized complexity of voter control in multi-peaked elections
• On the computation of fully proportional representation
• On the complexity of Chamberlin-Courant on almost structured profiles
• Parameterized Computational Complexity of Dodgson and Young Elections
• Parameterized complexity of control problems in Maximin election

Cites work

• A characterization of the single-peaked single-crossing domain
• An Exploration in the Theory of Optimum Income Taxation
• Choice is hard
• Handbook of Computational Social Choice
• On the complexity of Chamberlin-Courant on almost structured profiles
• Parameterized algorithms
• Recognizing 1-Euclidean preferences: an alternative approach
• Recognizing one-dimensional Euclidean preference profiles
• The one-dimensional Euclidean domain: finitely many obstructions are not enough

This page was built for publication: On the parameterized complexity of party nominations

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