On the parameterized complexity of party nominations

DOI10.1007/978-3-030-31489-7_8zbMath1431.91143OpenAlexW2979990986MaRDI QIDQ2290374

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

NP-hardnessvoting rulecandidate electionparty nominations

Mathematics Subject Classification ID

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

Cites Work

• Recognizing one-dimensional Euclidean preference profiles
• On the complexity of Chamberlin-Courant on almost structured profiles
• A characterization of the single-peaked single-crossing domain
• The one-dimensional Euclidean domain: finitely many obstructions are not enough
• Recognizing 1-Euclidean Preferences: An Alternative Approach
• Choice Is Hard
• Handbook of Computational Social Choice
• Parameterized Algorithms
• An Exploration in the Theory of Optimum Income Taxation

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