English
Related papers

Related papers: Dispute Resolution in Voting

200 papers

We introduce the confident voter model, in which each voter can be in one of two opinions and can additionally have two levels of commitment to an opinion --- confident and unsure. Upon interacting with an agent of a different opinion, a…

Physics and Society · Physics 2015-03-19 D. Volovik , S. Redner

Much of the success of multi-agent debates depends on carefully choosing the right parameters. The decision-making protocol stands out as it can highly impact final model answers, depending on how decisions are reached. Systematic…

Multiagent Systems · Computer Science 2025-10-01 Lars Benedikt Kaesberg , Jonas Becker , Jan Philip Wahle , Terry Ruas , Bela Gipp

We consider the problem of distributed multi-choice voting in a setting that each node can communicate with its neighbors merely by sending beep signals. Given its simplicity, the beep communication model is of practical importance in…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-10-20 Benyamin Ghojogh , Saber Salehkaleybar

We devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has…

Quantum Physics · Physics 2023-09-07 Kazuki Ikeda , Adam Lowe

Humans engage in informal debates on a daily basis. By expressing their opinions and ideas in an argumentative fashion, they are able to gain a deeper understanding of a given problem and in some cases, find the best possible course of…

Logic in Computer Science · Computer Science 2019-12-13 Ria Jha , Francesco Belardinelli , Francesca Toni

Previous work on voter control, which refers to situations where a chair seeks to change the outcome of an election by deleting, adding, or partitioning voters, takes for granted that the chair knows all the voters' preferences and that all…

Computer Science and Game Theory · Computer Science 2016-06-20 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

We study deliberative social choice, where voters engage in small-group discussions to output collective preferences that are then aggregated by a social choice rule. We introduce a simple deliberation-via-matching protocol. In this…

Computer Science and Game Theory · Computer Science 2026-04-27 Kamesh Munagala , Qilin Ye , Ian Zhang

Digital identity seems like a prerequisite for digital democracy: how can we ensure "one person, one vote" online without identifying voters? But digital identity solutions - ID checking, biometrics, self-sovereign identity, and trust…

Computers and Society · Computer Science 2020-11-05 Bryan Ford

We study voting games on binary issues, where voters hold an objective over the outcome of the collective decision and are allowed, before the vote takes place, to negotiate their voting strategy with the other participants. We analyse the…

Computer Science and Game Theory · Computer Science 2017-01-10 Umberto Grandi , Davide Grossi , Paolo Turrini

In this paper we propose a framework characterizing information disorders as disputes of narratives. Such narratives present claims to readers, who must decide whether to accept the statements in the claims as facts. We point out that this…

Computers and Society · Computer Science 2021-08-31 Daniel Schwabe

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

This article shows how fair voting methods can be a catalyst for change in the way we make collective decisions, and how such change can promote long-awaited upgrades of democracy. Based on real-world evidence from democratic innovations in…

Computers and Society · Computer Science 2025-12-22 Evangelos Pournaras

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

Each voter $i \in I$ has $\alpha_i$ cards that (s)he distributes among the candidates $a \in A$ as a measure of approval. One (or several) candidate(s) who received the maximum number of cards is (are) elected. We provide polynomial…

Combinatorics · Mathematics 2020-10-30 Endre Boros , Ondrej Cepek , Vladimir Gurvich , Kazuhisa Makino

Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in…

Computer Science and Game Theory · Computer Science 2019-06-18 Edith Elkind , Jiarui Gan , Svetlana Obraztsova , Zinovi Rabinovich , Alexandros A. Voudouris

As AI systems are used to answer more difficult questions and potentially help create new knowledge, judging the truthfulness of their outputs becomes more difficult and more important. How can we supervise unreliable experts, which have…

Artificial Intelligence · Computer Science 2023-11-16 Julian Michael , Salsabila Mahdi , David Rein , Jackson Petty , Julien Dirani , Vishakh Padmakumar , Samuel R. Bowman

In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the remaining voters are truthful. In this paper, we depart from…

Computer Science and Game Theory · Computer Science 2010-01-28 Yvo Desmedt , Edith Elkind

We present Phrase-Verified Voting, a voter-verifiable remote voting system assembled from commercial off-the-shelf software for small private elections. The system is transparent and enables each voter to verify that the tally includes…

Cryptography and Security · Computer Science 2021-03-15 Enka Blanchard , Ryan Robucci , Ted Selker , Alan Sherman

In approval voting, individuals vote for all platforms that they find acceptable. In this situation it is natural to ask: When is agreement possible? What conditions guarantee that some fraction of the voters agree on even a single…

Combinatorics · Mathematics 2021-08-30 Kristen Mazur , Mutiara Sondjaja , Matthew Wright , Carolyn Yarnall

Multi-winner approval elections are seen in a variety of settings ranging from academic societies and associations to public elections. In such elections, it is often the case that ballot-length restrictions are enforced; that is, where…

Computer Science and Game Theory · Computer Science 2017-11-15 Barton E. Lee
‹ Prev 1 4 5 6 7 8 10 Next ›