English
Related papers

Related papers: Dodgson's Rule Approximations and Absurdity

200 papers

We study two concepts of proportionality in the model of approval-based committee elections. In degressive proportionality small minorities of voters are favored in comparison with the standard linear proportionality. Regressive…

Computer Science and Game Theory · Computer Science 2022-01-13 Michal Jaworski , Piotr Skowron

Classical work on metric space based committee selection problem interprets distance as ``near is better''. In this work, motivated by real-life situations, we interpret distance as ``far is better''. Formally stated, we initiate the study…

Data Structures and Algorithms · Computer Science 2024-05-27 Sushmita Gupta , Tanmay Inamdar , Pallavi Jain , Daniel Lokshtanov , Fahad Panolan , Saket Saurabh

Typical voting rules do not work well in settings with many candidates. If there are just several hundred candidates, then even a simple task such as choosing a top candidate becomes impractical. Motivated by the hope of developing group…

Computer Science and Game Theory · Computer Science 2012-10-03 Ashish Goel , David Lee

Charles L. Dodgson, also known as Lewis Carroll, in his book "Pillow problems" from 1893 asked for the likelihood of a random triangle to be obtuse. Clearly, the answer to Dodgson's question depends strongly on the assumed random…

Probability · Mathematics 2025-08-27 Theodore D. Drivas , Michael Retakh

A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair…

Optimization and Control · Mathematics 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron

Intransitive dice $D^{(1)}, \ldots, D^{(\ell)}$ are dice such that $D^{(1)}$ has advantage when played against $D^{(2)}$, dice $D^{(2)}$ has advantage when played against $D^{(3)}$ and so on, up to $D^{(\ell)}$, which has advantage over…

We study the setting of single-winner elections with ordinal preferences where candidates might be members of \emph{alliances} (which may correspond to e.g., political parties, factions, or coalitions). However, we do not assume that…

Computer Science and Game Theory · Computer Science 2024-01-30 Grzegorz Pierczyński , Stanisław Szufa

We show how hidden interesting subelections can be discovered in ordinal elections. An interesting subelection consists of a reasonably large set of voters and a reasonably large set of candidates such that the former have a consistent…

Computer Science and Game Theory · Computer Science 2024-07-29 Łukasz Janeczko , Jérôme Lang , Grzegorz Lisowski , Stanisław Szufa

May's Theorem (1952), a celebrated result in social choice, provides the foundation for majority rule. May's crucial assumption of symmetry, often thought of as a procedural equity requirement, is violated by many choice procedures that…

Theoretical Economics · Economics 2020-09-01 Laurent Bartholdi , Wade Hann-Caruthers , Maya Josyula , Omer Tamuz , Leeat Yariv

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

This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules and provide an axiomatic…

Computer Science and Game Theory · Computer Science 2019-11-13 Martin Lackner , Piotr Skowron

We consider the problem of predicting winners in elections, for the case where we are given complete knowledge about all possible candidates, all possible voters (together with their preferences), but where it is uncertain either which…

Computer Science and Game Theory · Computer Science 2016-03-27 Krzysztof Wojtas , Krzysztof Magiera , Tomasz Miąsko , Piotr Faliszewski

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

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

Aggregating preferences under incomplete or constrained feedback is a fundamental problem in social choice and related domains. While prior work has established strong impossibility results for pairwise comparisons, this paper extends the…

Computer Science and Game Theory · Computer Science 2025-02-19 Evi Micha , Vasilis Varsamis

It is the purpose of the present article to collect arguments for, that there should exist in fact -- although not necessarily yet found -- some law, which imply an adjustment to special features to occur in the future. In our own "complex…

General Physics · Physics 2015-03-31 Holger Bech Nielsen

In 1904, Dickson [5] stated a very important conjecture. Now people call it Dickson's conjecture. In 1958, Schinzel and Sierpinski [14] generalized Dickson's conjecture to the higher order integral polynomial case. However, they did not…

General Mathematics · Mathematics 2009-11-11 Shaohua Zhang

A number of problems in physics, mathematics, and philosophy involve observers in given situations which lead to debates about whether observer-specific information should affect the probability for some outcome or hypothesis. Our purpose…

History and Philosophy of Physics · Physics 2020-09-15 Robert Garisto

In economics and psychology, delay discounting is often used to characterize how individuals choose between a smaller immediate reward and a larger delayed reward. People with higher delay discounting rate (DDR) often choose smaller but…

Artificial Intelligence · Computer Science 2017-03-27 Tao Ding , Warren K. Bickel , Shimei Pan