English
Related papers

Related papers: Campaign Management under Approval-Driven Voting R…

200 papers

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

Citizen-focused democratic processes where participants deliberate on alternatives and then vote to make the final decision are increasingly popular today. While the computational social choice literature has extensively investigated voting…

Multiagent Systems · Computer Science 2023-05-17 Kanav Mehra , Nanda Kishore Sreenivas , Kate Larson

Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…

Computer Science and Game Theory · Computer Science 2012-07-09 Vincent Conitzer , Tuomas Sandholm

Issue salience is a major determinant in voters' decisions. Candidates and political parties campaign to shift salience to their advantage - a process termed priming. We study the dynamics, strategies and equilibria of campaign spending for…

Computer Science and Game Theory · Computer Science 2024-12-30 Jonathan Shaki , Yonatan Aumann , Sarit Kraus

Constructive election control considers the problem of an adversary who seeks to sway the outcome of an electoral process in order to ensure that their favored candidate wins. We consider the computational problem of constructive election…

Computer Science and Game Theory · Computer Science 2019-12-02 Jasper Lu , David Kai Zhang , Zinovi Rabinovich , Svetlana Obraztsova , Yevgeniy Vorobeychik

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

State-of-the-art results in typical classification tasks are mostly achieved by unexplainable machine learning methods, like deep neural networks, for instance. Contrarily, in this paper, we investigate the application of rule learning…

Machine Learning · Computer Science 2024-03-11 Albert Nössig , Tobias Hell , Georg Moser

Ranked voting systems, such as instant-runoff voting (IRV) and single transferable vote (STV), are used in many places around the world. They are more complex than plurality and scoring rules, presenting a challenge for auditing their…

Today, Internet involves many actors who are making revenues on it (operators, companies, service providers,...). It is therefore important to be able to make fair decisions in this large-scale and highly competitive economical ecosystem.…

Networking and Internet Architecture · Computer Science 2012-05-01 François Durand , Fabien Mathieu , Ludovic Noirie

Several elections run in the last years have been characterized by attempts to manipulate the result of the election through the diffusion of fake or malicious news over social networks. This problem has been recognized as a critical issue…

Computer Science and Game Theory · Computer Science 2023-08-22 Vincenzo Auletta , Francesco Carbone , Diodato Ferraioli

The single transferable vote (STV) is a system of preferential proportional voting employed in multi-seat elections. Each ballot cast by a voter is a (potentially partial) ranking over a set of candidates. The margin of victory, or simply…

Computer Science and Game Theory · Computer Science 2025-03-26 Michelle Blom , Alexander Ek , Peter J. Stuckey , Vanessa Teague , Damjan Vukcevic

To help their users to discover important items at a particular time, major websites like Twitter, Yelp, TripAdvisor or NYTimes provide Top-K recommendations (e.g., 10 Trending Topics, Top 5 Hotels in Paris or 10 Most Viewed News Stories),…

Social and Information Networks · Computer Science 2018-11-22 Abhijnan Chakraborty , Gourab K Patro , Niloy Ganguly , Krishna P. Gummadi , Patrick Loiseau

For many voting rules, it is NP-hard to compute a successful manipulation. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. We study empirically…

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

We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$,…

Computer Science and Game Theory · Computer Science 2026-03-17 Emilio De Santis , Antonio Di Crescenzo , Verdiana Mustaro

We study binary opinion dynamics in a fully connected network of interacting agents. The agents are assumed to interact according to one of the following rules: (1) Voter rule: An updating agent simply copies the opinion of another randomly…

Probability · Mathematics 2022-03-04 Arpan Mukhopadhyay , Ravi R. Mazumdar , Rahul Roy

By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to…

Artificial Intelligence · Computer Science 2025-02-25 Wesley H. Holliday , Alexander Kristoffersen , Eric Pacuit

This study explores the relationship between voter trust and their experiences during elections by applying a rule-based data mining technique to the 2022 Survey of the Performance of American Elections (SPAE). Using the Apriori algorithm…

Computers and Society · Computer Science 2025-07-22 Md Al Jubair , Mohammad Shamsul Arefin , Ahmed Wasif Reza

The successive and the amendment procedures have been widely employed in parliamentary and legislative decision making and have undergone extensive study in the literature from various perspectives. However, investigating them through the…

Computer Science and Game Theory · Computer Science 2025-03-19 Yongjie Yang

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

When voter preferences are known in an incomplete (partial) manner, winner determination is commonly treated as the identification of the necessary and possible winners; these are the candidates who win in all completions or at least one…

Computer Science and Game Theory · Computer Science 2020-02-24 Aviram Imber , Benny Kimelfeld