Structured proportional representation

DOI10.1016/j.tcs.2017.10.028zbMath1408.91067OpenAlexW2765982135WikidataQ62039053 ScholiaQ62039053MaRDI QIDQ1686072

Nimrod Talmon

Publication date: 20 December 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.10.028

zbMATH Keywords

treewidthgraph algorithmsmultiwinner elections

Mathematics Subject Classification ID

Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Gerrymandering on graphs: computational complexity and parameterized algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Should social network structure be taken into account in elections?
• Convex recolorings of strings and trees: Definitions, hardness results and algorithms
• Partition into cliques for cubic graphs: Planar case, complexity and approximation
• Combinatorial voter control in elections
• Justified representation in approval-based committee voting
• On the complexity of achieving proportional representation
• Complexity of graph partition problems
• Approval Balloting for Multi-winner Elections
• On the Computation of Fully Proportional Representation
• Partitioning Graphs into Connected Parts
• OWA-Based Extensions of the Chamberlin–Courant Rule
• Parameterized Algorithms

This page was built for publication: Structured proportional representation