English
Related papers

Related papers: Why Majority Judgement is not yet the solution for…

200 papers

In an election, we are given a set of voters, each having a preference list over a set of candidates, that are distributed on a social network. We consider a scenario where voters may change their preference lists as a consequence of the…

Social and Information Networks · Computer Science 2020-06-01 Mohammad Abouei Mehrizi , Gianlorenzo D'Angelo

The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…

Computer Science and Game Theory · Computer Science 2018-02-27 Batya Kenig

Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating together preferences of multiple agents. We study here the…

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

Suppose we are given a family of choice functions on pairs from a given finite set. The set is considered as a set of alternatives (say candidates for an office) and the functions as potential "voters". The question is, what choice…

Combinatorics · Mathematics 2014-03-11 Paul Larson , Nick Matteo , Saharon Shelah

Voting methods are instrumental design elements of democracies. Citizens use them to express and aggregate their preferences to reach a collective decision. However, voting outcomes can be as sensitive to voting rules as they are to…

We study elections where voters are faced with the challenge of expressing preferences over an extreme number of issues under consideration. This is largely motivated by emerging blockchain governance systems, which include voters with…

Computer Science and Game Theory · Computer Science 2024-05-15 Georgios Amanatidis , Aris Filos-Ratsikas , Philip Lazos , Evangelos Markakis , Georgios Papasotiropoulos

The use of language-model-based question-answering systems to aid humans in completing difficult tasks is limited, in part, by the unreliability of the text these systems generate. Using hard multiple-choice reading comprehension questions…

Computation and Language · Computer Science 2022-10-21 Alicia Parrish , Harsh Trivedi , Nikita Nangia , Vishakh Padmakumar , Jason Phang , Amanpreet Singh Saimbhi , Samuel R. Bowman

Many democratic political parties hold primary elections, which nicely reflects their democratic nature and promote, among other things, the democratic value of inclusiveness. However, the methods currently used for holding such primary…

Multiagent Systems · Computer Science 2022-01-20 Ariel Rosenfeld , Ehud Shapiro , Nimrod Talmon

Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea''…

Computer Science and Game Theory · Computer Science 2008-03-05 Josep Freixas , Xavier Molinero , Martin Olsen , Maria Serna

Citizens' assemblies are an increasingly influential form of deliberative democracy, where randomly selected people discuss policy questions. The legitimacy of these assemblies hinges on their representation of the broader population, but…

Machine Learning · Computer Science 2025-08-13 Angelos Assos , Carmel Baharav , Bailey Flanigan , Ariel Procaccia

We study computational problems for two popular parliamentary voting procedures: the amendment procedure and the successive procedure. While finding successful manipulations or agenda controls is tractable for both procedures, our…

Computer Science and Game Theory · Computer Science 2015-09-09 Robert Bredereck , Jiehua Chen , Rolf Niedermeier , Toby Walsh

Most of the computational study of election problems has assumed that each voter's preferences are, or should be extended to, a total order. However in practice voters may have preferences with ties. We study the complexity of manipulative…

Computer Science and Game Theory · Computer Science 2015-06-16 Zack Fitzsimmons , Edith Hemaspaandra

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

Computer Science and Game Theory · Computer Science 2023-10-19 Markus Brill , Stefan Forster , Martin Lackner , Jan Maly , Jannik Peters

Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints may take various…

Artificial Intelligence · Computer Science 2020-12-29 Jian Zhang , Cunjing Ge , Feifei Ma

We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.

Computer Science and Game Theory · Computer Science 2007-05-23 Piotr Faliszewski , Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

The indoctrination game is a complete-information contest over public opinion. The players exert costly effort to manifest their private opinions in public in order to control the discussion, so that the governing opinion is similar to…

Theoretical Economics · Economics 2023-05-05 Lotem Ikan , David Lagziel

We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval voting with deterministic or uniform tie-breaking rules. We…

Computer Science and Game Theory · Computer Science 2019-04-19 Oren Dean , Yakov Babichenko , Moshe Tennenholtz

Peer reviews, evaluations, and selections are a fundamental aspect of modern science. Funding bodies the world over employ experts to review and select the best proposals from those submitted for funding. The problem of peer selection,…

Computer Science and Game Theory · Computer Science 2019-05-01 Haris Aziz , Omer Lev , Nicholas Mattei , Jeffrey S. Rosenschein , Toby Walsh

Many applications, such as content moderation and recommendation, require reviewing and scoring a large number of alternatives. Doing so robustly is however very challenging. Indeed, voters' inputs are inevitably sparse: most alternatives…

Computer Science and Game Theory · Computer Science 2024-01-26 Youssef Allouah , Rachid Guerraoui , Lê-Nguyên Hoang , Oscar Villemaud

Partisan gerrymandering poses a threat to democracy. Moreover, the complexity of the districting task may exceed human capacities. One potential solution is using computational models to automate the districting process by optimizing…

Computers and Society · Computer Science 2020-06-30 Olivia Guest , Frank J. Kanayet , Bradley C. Love