English
Related papers

Related papers: Voting with Limited Information and Many Alternati…

200 papers

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 Condorcet criterion (CC) is a classical and well-accepted criterion for voting. Unfortunately, it is incompatible with many other desiderata including participation (Par), half-way monotonicity (HM), Maskin monotonicity (MM), and…

Theoretical Economics · Economics 2022-08-22 Lirong Xia

The metric distortion framework posits that n voters and m candidates are jointly embedded in a metric space such that voters rank candidates that are closer to them higher. A voting rule's purpose is to pick a candidate with minimum total…

Computer Science and Game Theory · Computer Science 2023-07-03 Fatih Erdem Kizilkaya , David Kempe

A new game-theoretic approach for combining multiple classifiers is proposed. A short introduction in Game Theory and coalitions illustrate the way any collective decision scheme can be viewed as a competitive game of coalitions that are…

Computer Science and Game Theory · Computer Science 2015-02-10 Harris V. Georgiou

Given a set of conflicting arguments, there can exist multiple plausible opinions about which arguments should be accepted, rejected, or deemed undecided. We study the problem of how multiple such judgments can be aggregated. We define the…

Artificial Intelligence · Computer Science 2017-06-20 Edmond Awad , Richard Booth , Fernando Tohme , Iyad Rahwan

When each voter rates or ranks several candidates for a single office, a strong Condorcet winner (SCW) is one who beats all others in two-way races. Among 21 electoral systems examined, 18 will sometimes make candidate X the winner even if…

Methodology · Statistics 2016-09-22 Richard B. Darlington

Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters…

Multiagent Systems · Computer Science 2014-06-27 Laurent Bulteau , Jiehua Chen , Piotr Faliszewski , Rolf Niedermeier , Nimrod Talmon

In many collective decision making situations, agents vote to choose an alternative that best represents the preferences of the group. Agents may manipulate the vote to achieve a better outcome by voting in a way that does not reflect their…

Computer Science and Game Theory · Computer Science 2019-12-03 Jaelle Scheuerman , Jason L. Harman , Nicholas Mattei , K. Brent Venable

We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base…

Artificial Intelligence · Computer Science 2012-03-15 Nina Narodytska , Toby Walsh , Lirong Xia

Limited Voting (LV) is an approval-based method for multi-winner elections where all ballots are required to have a same fixed size. While it appears to be used as voting method in corporate governance and has some political applications,…

Computer Science and Game Theory · Computer Science 2024-07-26 Maaike Venema-Los , Zoé Christoff , Davide Grossi

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

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

This paper investigates the voting behaviors of Large Language Models (LLMs), specifically GPT-4 and LLaMA-2, their biases, and how they align with human voting patterns. Our methodology involved using a dataset from a human voting…

Computation and Language · Computer Science 2024-12-20 Joshua C. Yang , Damian Dailisan , Marcin Korecki , Carina I. Hausladen , Dirk Helbing

Are there voting methods which (i) give everyone, including minorities, an equal share of effective power even if voters act strategically, (ii) promote consensus rather than polarization and inequality, and (iii) do not favour the status…

General Economics · Economics 2020-06-12 Jobst Heitzig , Forest W. Simmons

Majority voting is considered an effective method to enhance chain-of-thought reasoning, as it selects the answer with the highest "self-consistency" among different reasoning paths (Wang et al., 2023). However, previous chain-of-thought…

Computation and Language · Computer Science 2025-05-19 Weiqin Wang , Yile Wang , Hui Huang

Liquid democracy is the principle of making collective decisions by letting agents transitively delegate their votes. Despite its significant appeal, it has become apparent that a weakness of liquid democracy is that a small subset of…

Computer Science and Game Theory · Computer Science 2019-11-20 Paul Gölz , Anson Kahng , Simon Mackenzie , Ariel D. Procaccia

Iterative voting is a natural model of repeated strategic decision-making in social choice theory when agents have the opportunity to update their votes prior to finalizing the group decision. Prior work has analyzed the efficacy of…

Computer Science and Game Theory · Computer Science 2025-06-12 Joshua Kavner , Lirong Xia

We study electoral campaign management scenarios in which an external party can buy votes, i.e., pay the voters to promote its preferred candidate in their preference rankings. The external party's goal is to make its preferred candidate a…

Computer Science and Game Theory · Computer Science 2010-11-29 Edith Elkind , Piotr Faliszewski

This note characterizes every qualified majority voting rule in environments with just two alternatives through anonymity, responsiveness, and q-neutrality. Crucially, the latter imposes independence of the labels of the alternatives if and…

Theoretical Economics · Economics 2025-11-20 Héctor Hermida-Rivera

We focus on the following natural question: is it possible to influence the outcome of a voting process through the strategic provision of information to voters who update their beliefs rationally? We investigate whether it is…

Computer Science and Game Theory · Computer Science 2019-09-24 Matteo Castiglioni , Andrea Celli , Nicola Gatti