ResearchTrend.AI
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules

Krzysztof Sornat
Virginia Vassilevska Williams
Yinzhan Xu
ArXiv (abs)PDFHTML

Papers citing "Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules"

1 / 1 papers shown
Title
Computational Social Choice: Parameterized Complexity and Challenges
Computational Social Choice: Parameterized Complexity and Challenges
Jiehua Chena
Christian Hatschka
Sofia Simola
70
1
0
17 Oct 2024