English
Related papers

Related papers: Selecting Voting Locations for Fun and Profit

200 papers

The gerrymandering problem is a worldwide problem which sets great threat to democracy and justice in district based elections. Thanks to partisan redistricting commissions, district boundaries are often manipulated to benefit incumbents.…

Computers and Society · Computer Science 2015-10-14 Lucy Chenyun Wu , Jason Xiaotian Dou , Danny Sleator , Alan Frieze , David Miller

In many real world situations, collective decisions are made using voting and, in scenarios such as committee or board elections, employing voting rules that return multiple winners. In multi-winner approval voting (AV), an agent submits a…

Computer Science and Game Theory · Computer Science 2020-12-08 Jaelle Scheuerman , Jason Harman , Nicholas Mattei , K. Brent Venable

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Data Structures and Algorithms · Computer Science 2019-01-31 Matthias Bentert , Piotr Skowron

We consider distributed elections, where there is a center and $k$ sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware…

Computer Science and Game Theory · Computer Science 2019-07-24 Arnold Filtser , Nimrod Talmon

Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…

Data Structures and Algorithms · Computer Science 2024-12-17 Juhi Chaudhary , Hendrik Molter , Meirav Zehavi

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballot and use a voting rule to decide the winning action(s).…

Artificial Intelligence · Computer Science 2012-04-18 Toby Walsh

We consider a social choice setting with agents that are partitioned into disjoint groups, and have metric preferences over a set of alternatives. Our goal is to choose a single alternative aiming to optimize various objectives that are…

Computer Science and Game Theory · Computer Science 2021-07-13 Elliot Anshelevich , Aris Filos-Ratsikas , Alexandros A. Voudouris

It is well known that no reasonable voting rule is strategyproof. Moreover, the common Plurality rule is particularly prone to strategic behavior of the voters and empirical studies show that people often vote strategically in practice.…

Computer Science and Game Theory · Computer Science 2014-04-22 Reshef Meir , Omer Lev , Jeffrey S. Rosenschein

"Control" studies attempts to set the outcome of elections through the addition, deletion, or partition of voters or candidates. The set of benchmark control types was largely set in the seminal 1992 paper by Bartholdi, Tovey, and Trick…

Computer Science and Game Theory · Computer Science 2014-10-13 Gabor Erdelyi , Edith Hemaspaandra , Lane A. Hemaspaandra

We study the distributed facility location problem, where a set of agents with positions on the line of real numbers are partitioned into disjoint districts, and the goal is to choose a point to satisfy certain criteria, such as optimize an…

Computer Science and Game Theory · Computer Science 2023-01-05 Aris Filos-Ratsikas , Panagiotis Kanellopoulos , Alexandros A. Voudouris , Rongsen Zhang

We study a truthful two-facility location problem in which a set of agents have private positions on the line of real numbers and known approval preferences over two different facilities. Given the locations of the two facilities, the cost…

Computer Science and Game Theory · Computer Science 2024-01-10 Panagiotis Kanellopoulos , Alexandros A. Voudouris , Rongsen Zhang

Affective polarization and increasing social divisions affect social mixing and the spread of information across online and physical spaces, reinforcing social and electoral cleavages and influencing political outcomes. Here, using…

Social and Information Networks · Computer Science 2025-10-06 Marco Tonin , Bruno Lepri , Michele Tizzoni

In a voting problem with a finite set of alternatives to choose from, we study the manipulation of tops-only rules. Since all non-dictatorial (onto) voting rules are manipulable when there are more than two alternatives and all preferences…

Theoretical Economics · Economics 2022-10-24 R. Pablo Arribillaga , Agustin G. Bonifacio

In this paper, we apply genetic algorithms to the field of electoral studies. Forecasting election results is one of the most exciting and demanding tasks in the area of market research, especially due to the fact that decisions have to be…

Neural and Evolutionary Computing · Computer Science 2014-01-21 Ronald Hochreiter , Christoph Waldhauser

The Hotelling-Downs model considers parties changing policy to maximise their vote-share. Where policy position lies on a left-right axis, it describes a tendency for political parties to move towards centrist platforms. This is in contrast…

Physics and Society · Physics 2026-05-12 Christopher Campbell , Graeme J. Ackland

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 is to make a specific candidate either win…

Multiagent Systems · Computer Science 2017-01-19 Leon Kellerhals , Viatcheslav Korenwein , Philipp Zschoche , Robert Bredereck , Jiehua Chen

We consider a distributed voting problem with a set of agents that are partitioned into disjoint groups and a set of obnoxious alternatives. Agents and alternatives are represented by points in a metric space. The goal is to compute the…

Computer Science and Game Theory · Computer Science 2024-12-17 Alexandros A. Voudouris

In 1992, Bartholdi, Tovey, and Trick opened the study of control attacks on elections---attempts to improve the election outcome by such actions as adding/deleting candidates or voters. That work has led to many results on how algorithms…

Computer Science and Game Theory · Computer Science 2010-07-13 Piotr Faliszewski , Edith Hemaspaandra , Lane A. Hemaspaandra

Political polarization can be beneficial to competing political parties. I study how electoral competition itself generates incentives to polarize voters, even when parties are ex ante identical and motivated purely by political power,…

General Economics · Economics 2026-02-02 Giampaolo Bonomi