On the complexity of Chamberlin-Courant on almost structured profiles

DOI10.1007/978-3-319-67504-6_9zbMATH Open1398.91235OpenAlexW2757827805MaRDI QIDQ1990291FDOQ1990291

Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan

Publication date: 25 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-67504-6_9

Recommendations

• The complexity of fully proportional representation for single-crossing electorates
• Preferences Single-Peaked on a Circle
• OWA-based extensions of the Chamberlin-Courant rule
• The complexity of fully proportional representation for single-crossing electorates
• Preferences single-peaked on a tree: multiwinner elections and structural results

zbMATH Keywords

fixed-parameter algorithmsNP-hardnessvoting rulesChamberlin Courantsingle-crossing profilessingle-peaked profiles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Cited In (3)

• On the parameterized complexity of party nominations
• Polynomial-time data reduction for weighted problems beyond additive goal functions
• A characterization of the single-peaked single-crossing domain

This page was built for publication: On the complexity of Chamberlin-Courant on almost structured profiles

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