7 citations · 8 across the 5 of their papers we have counts for
5 papers
Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences
Jiehua Chen, Christian Hatschka, Sofia Simola
We investigate winner determination for two popular proportional representation systems: the Monroe and Chamberlin-Courant (abbrv. CC) systems. Our study focuses on (nearly) single…
Optimal Seat Arrangement: What Are the Hard and Easy Cases?
Esra Ceylan, Jiehua Chen, Sanjukta Roy
We study four NP-hard optimal seat arrangement problems [Bodlaender et al., 2020a], which each have as input a set of n agents, where each agent has cardinal preferences over other…
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche +2
Voter control problems model situations in which an external agent tries toaffect the result of an election by adding or deleting the fewest number of voters. The goal of the agent…
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Robert Bredereck, Jiehua Chen, Piotr Faliszewski +3
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (…
Combinatorial Voter Control in Elections
Laurent Bulteau, Jiehua Chen, Piotr Faliszewski +2
Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who wou…