English
Related papers

Related papers: Common Voting Rules as Maximum Likelihood Estimato…

200 papers

Consider the decision-making setting where agents elect a panel by expressing both positive and negative preferences. Prominently, in constitutional AI, citizens democratically select a slate of ethical preferences on which a foundation…

Computer Science and Game Theory · Computer Science 2025-03-05 Sonja Kraiczy , Georgios Papasotiropoulos , Grzegorz Pierczyński , Piotr Skowron

The Shapley value is commonly illustrated by roll call votes in which players support or reject a proposal in sequence. If all sequences are equiprobable, a voter's Shapley value can be interpreted as the probability of being pivotal, i.e.,…

Computer Science and Game Theory · Computer Science 2018-10-04 Sascha Kurz , Stefan Napel

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…

Computer Science and Game Theory · Computer Science 2021-05-18 Jonas Israel , Markus Brill

In this communication, we propose a tentative to set the fundamental problem of measuring process done by a large structure on a microsopic one. We consider the example of voting when an entire society tries to measure globally opinions of…

Physics and Society · Physics 2024-11-08 François Dubois

The notions of noise sensitivity and stability were recently extended for the voter model. In this model, the vertices of a graph have opinions that are updated by uniformly selecting edges. We further extend stability results to different…

Probability · Mathematics 2026-01-16 Gideon Amir , Omer Angel , Rangel Baldasso , Daniel de la Riva

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show…

Computer Science and Game Theory · Computer Science 2014-07-14 Haris Aziz , Serge Gaspers , Joachim Gudmundsson , Simon Mackenzie , Nicholas Mattei , Toby Walsh

We consider a type of pull voting suitable for discrete numeric opinions which can be compared on a linear scale, for example, 1 ('disagree strongly'), 2 ('disagree'), $\ldots,$ 5 ('agree strongly'). On observing the opinion of a random…

Probability · Mathematics 2023-05-26 Colin Cooper , Tomasz Radzik , Takeharu Shiraga

To understand and summarize approval preferences and other binary evaluation data, it is useful to order the items on an axis which explains the data. In a political election using approval voting, this could be an ideological left-right…

Computer Science and Game Theory · Computer Science 2024-05-08 Théo Delemazure , Chris Dong , Dominik Peters , Magdaléna Tydrichová

The voting method, an ensemble approach for fundamental frequency estimation, is empirically known for its robustness but lacks thorough investigation. This paper provides a principled analysis and improvement of this technique. First, we…

Sound · Computer Science 2026-02-03 Junya Koguchi , Tomoki Koriyama

Contributing to the toolbox for interpreting election results, we evaluate the robustness of election winners to random noise. We compare the robustness of different voting rules and evaluate the robustness of real-world election winners…

Computer Science and Game Theory · Computer Science 2022-08-30 Niclas Boehmer , Robert Bredereck , Piotr Faliszewski , Rolf Niedermeier

The voter model is a toy model of consensus formation based on nearest-neighbor interactions. A voter sits at each vertex in a hypercubic lattice (of dimension $d$) and is in one of two possible opinion states. The opinion state of each…

Statistical Mechanics · Physics 2023-11-08 Pascal Grange

Pull voting is a random process in which vertices of a connected graph have initial opinions chosen from a set of $k$ distinct opinions, and at each step a random vertex alters its opinion to that of a randomly chosen neighbour. If the…

Discrete Mathematics · Computer Science 2024-09-20 Colin Cooper , Tomasz Radzik , Takeharu Shiraga

We present a new optimization-based method for aggregating preferences in settings where each voter expresses preferences over pairs of alternatives. Our approach to identifying a consensus partial order is motivated by the observation that…

Social and Information Networks · Computer Science 2025-01-28 Nathan Atkinson , Scott C. Ganz , Dorit S. Hochbaum , James B. Orlin

General regression and classification models are constructed as linear combinations of simple rules derived from the data. Each rule consists of a conjunction of a small number of simple statements concerning the values of individual input…

Applications · Statistics 2008-11-12 Jerome H. Friedman , Bogdan E. Popescu

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…

Computer Science and Game Theory · Computer Science 2017-11-17 Haris Aziz , Barton E. Lee

Judgment aggregation problems form a class of collective decision-making problems represented in an abstract way, subsuming some well known problems such as voting. A collective decision can be reached in many ways, but a direct one-step…

Artificial Intelligence · Computer Science 2016-08-30 Marija Slavkovik , Wojciech Jamroga

Approval voting is widely used for making multi-winner voting decisions. The canonical rule (also called Approval Voting) used in the setting aims to maximize social welfare by selecting candidates with the highest number of approvals. We…

Computer Science and Game Theory · Computer Science 2026-04-21 Haris Aziz , Yuhang Guo , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

In this paper, we propose a family of approval voting-schemes for electing committees based on the preferences of voters. In our schemes, we calculate the vector of distances of the possible committees from each of the ballots and, for a…

Computer Science and Game Theory · Computer Science 2018-01-24 Shankar N. Sivarajan

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