English
Related papers

Related papers: Selecting Voting Locations for Fun and Profit

200 papers

We consider a social choice problem where only a small number of people out of a large population are sufficiently available or motivated to vote. A common solution to increase participation is to allow voters use a proxy, that is, transfer…

Computer Science and Game Theory · Computer Science 2016-11-28 Gal Cohensius , Shie Manor , Reshef Meir , Eli Meirom , Ariel Orda

Much of the theoretical work on strategic voting makes strong assumptions about what voters know about the voting situation. A strategizing voter is typically assumed to know how other voters will vote and to know the rules of the voting…

Multiagent Systems · Computer Science 2019-07-23 Wesley H. Holliday , Eric Pacuit

It is well known, by the Gibbard-Satterthwaite Theorem, that when there are more than two candidates, any non-dictatorial voting rule can be manipulated by untruthful voters. But how strong is the incentive to manipulate under different…

Computer Science and Game Theory · Computer Science 2026-02-27 Ratip Emin Berker , Vincent Conitzer , Eden Hartman , Jiayuan Liu , Caspar Oesterheld

Voting is a general method for preference aggregation in multiagent settings, but seminal results have shown that all (nondictatorial) voting protocols are manipulable. One could try to avoid manipulation by using voting protocols where…

Computer Science and Game Theory · Computer Science 2009-09-29 Vincent Conitzer , Tuomas Sandholm

In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols are…

Computer Science and Game Theory · Computer Science 2009-09-29 Vincent Conitzer , Jerome Lang , Tuomas Sandholm

We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form of two new greedy manipulation algorithms based on intuitions…

Artificial Intelligence · Computer Science 2010-07-30 Jessica Davies , George Katsirelos , Nina Narodystka , Toby Walsh

Many democratic countries use district-based elections where there is a "seat" for each district in the governing body. In each district, the party whose candidate gets the maximum number of votes wins the corresponding seat. The result of…

Applications · Statistics 2020-06-23 Adway Mitra

Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting rules are, in the general case, computationally resistant to some of these manipulative actions. However when restricted to…

Computational Complexity · Computer Science 2017-07-24 Gábor Erdélyi , Martin Lackner , Andreas Pfandler

Democracies employ elections at various scales to select officials at the corresponding levels of administration. The geographical distribution of political opinion, the policy issues delegated to each level, and the multilevel interactions…

Applications · Statistics 2022-11-03 Sihao Huang , Alexander F. Siegenfeld , Andrew Gelman

We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information set, which is the set of profiles of the nonmanipulators…

Artificial Intelligence · Computer Science 2011-06-28 Vincent Conitzer , Toby Walsh , Lirong Xia

Why not have a computer just draw a map? This is something you hear a lot when people talk about gerrymandering, and it's easy to think at first that this could solve redistricting altogether. But there are more than a couple problems with…

Data Structures and Algorithms · Computer Science 2020-11-20 Amariah Becker , Justin Solomon

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…

Computer Science and Game Theory · Computer Science 2017-07-28 Edith Elkind , Umberto Grandi , Francesca Rossi , Arkadii Slinko

The Coalitional Manipulation problem has been studied extensively in the literature for many voting rules. However, most studies have focused on the complete information setting, wherein the manipulators know the votes of the…

Multiagent Systems · Computer Science 2017-07-14 Palash Dey , Neeldhara Misra , Y. Narahari

Political districts may be drawn to favor one group or political party over another, or gerrymandered. A number of measurements have been suggested as ways to detect and prevent such behavior. These measures give concrete axes along which…

Computers and Society · Computer Science 2023-06-22 Richard Barnes , Justin Solomon

Bizarrely shaped voting districts are frequently lambasted as likely instances of gerrymandering. In order to systematically identify such instances, researchers have devised several tests for so-called geographic compactness (i.e., shape…

Combinatorics · Mathematics 2019-07-10 Boris Alexeev , Dustin G. Mixon

We study strategic candidate positioning in multidimensional spatial-voting elections. Voters and candidates are represented as points in $\mathbb{R}^d$, and each voter supports the candidate that is closest under a distance induced by an…

Computer Science and Game Theory · Computer Science 2025-08-20 Colin Cleveland , Bart de Keijzer , Maria Polukarov

Pretrained language models (PLMs) often fail to fairly represent target users from certain world regions because of the under-representation of those regions in training datasets. With recent PLMs trained on enormous data sources,…

Computation and Language · Computer Science 2022-12-21 Fahim Faisal , Antonios Anastasopoulos

Much research in electoral control -- one of the most studied form of electoral attacks, in which an entity running an election alters the structure of that election to yield a preferred outcome -- has focused on giving decision complexity…

Computer Science and Game Theory · Computer Science 2026-05-14 Huy Vu Bui , Michael C. Chavrimootoo , Kien T. Le , Son M. Nguyen

Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important…

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

Voter suppression and associated racial disparities in access to voting are long-standing civil rights concerns in the United States. Barriers to voting have taken many forms over the decades. A history of violent explicit discouragement…

Computers and Society · Computer Science 2022-05-31 Mohsen Abbasi , Suresh Venkatasubramanian , Sorelle A. Friedler , Kristian Lum , Calvin Barrett