District-based elections, in which voters vote for a district representative and those
representatives ultimately choose the winner, are vulnerable to gerrymandering, ie …

Gerrymandering is the process by which parties manipulate boundaries of electoral districts
in order to maximize the number of districts they can win. Demographic trends show an …

Much of the social choice literature examines direct voting systems, in which voters submit
their ranked preferences over candidates and a voting rule picks a winner. Real-world …

District-based manipulation, or gerrymandering, is usually taken to refer to agents who are in
fixed location, and an external division is imposed upon them. However, in many real-world …

In many practical scenarios, a population is divided into disjoint groups for better
administration, eg, electorates into political districts, employees into departments, students …

We initiate the systematic algorithmic study for gerrymandering over graphs that was
recently introduced by Cohen-Zemach, Lewenberg and Rosenschein. Namely, we study a …

In the last few years, a lot of the activity of the computational social choice community has
focused on novel mechanisms for reaching decisions by large groups of people. While this …

This paper studies gerrymandering on graphs from a computational viewpoint (introduced
by Cohen-Zemach et al. AAMAS 2018 and continued by Ito et al. AAMAS 2019). Our …

The partition of graphs into “nice” subgraphs is a central algorithmic problem with strong ties
to matching theory. We study the partitioning of undirected graphs into same‐size stars, a …

Gerrymandering is the process of creating electoral districts for partisan advantage, allowing
a party to win more seats than what is reasonable for their vote. While research on …