English
Related papers

Related papers: Distortion of Metric Voting with Bounded Randomnes…

200 papers

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

With the Dodgson rule, cloning the electorate can change the winner, which Young (1977) considers an "absurdity". Removing this absurdity results in a new rule (Fishburn, 1977) for which we can compute the winner in polynomial time (Rothe…

Combinatorics · Mathematics 2010-08-10 John C. McCabe-Dansted

Whenever inspected by humans, reconstructed signals should not be distinguished from real ones. Typically, such a high perceptual quality comes at the price of high reconstruction error, and vice versa. We study this distortion-perception…

Information Theory · Computer Science 2024-02-06 Dror Freirich , Nir Weinberger , Ron Meir

In a voting problem with a finite set of alternatives to choose from, we study the manipulation of tops-only rules. Since all non-dictatorial (onto) voting rules are manipulable when there are more than two alternatives and all preferences…

Theoretical Economics · Economics 2022-10-24 R. Pablo Arribillaga , Agustin G. Bonifacio

The traditional axiomatic approach to voting is motivated by the problem of reconciling differences in subjective preferences. In contrast, a dominant line of work in the theory of voting over the past 15 years has considered a different…

Discrete Mathematics · Computer Science 2015-12-19 Flavio Chierichetti , Jon Kleinberg

The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Data Structures and Algorithms · Computer Science 2019-01-31 Matthias Bentert , Piotr Skowron

We study the distribution of maxima (Extreme Value Statistics) for sequences of observables computed along orbits generated by random transformations. The underlying, deterministic, dynamical system can be regular or chaotic. In the former…

Dynamical Systems · Mathematics 2015-06-11 Davide Faranda , Jorge Milhazes Freitas , Valerio Lucarini , Giorgio Turchetti , Sandro Vaienti

We consider voting on multiple independent binary issues. In addition, a weighting vector for each voter defines how important they consider each issue. The most natural way to aggregate the votes into a single unified proposal is…

Computer Science and Game Theory · Computer Science 2025-02-21 Carmel Baharav , Andrei Constantinescu , Roger Wattenhofer

Boxing has a long-standing problem with biased judging, impacting both professional and Olympic bouts. "Robberies", where boxers are widely seen as being denied rightful victories, threaten to drive fans and athletes away from the sport. To…

General Economics · Economics 2024-06-28 Stuart Baumann , Carl Singleton

In the Shift Bribery problem, we are given an election (based on preference orders), a preferred candidate $p$, and a budget. The goal is to ensure that $p$ wins by shifting $p$ higher in some voters' preference orders. However, each such…

Multiagent Systems · Computer Science 2016-11-29 Robert Bredereck , Jiehua Chen , Piotr Faliszewski , André Nichterlein , Rolf Niedermeier

In a setting where $m$ items need to be partitioned among $n$ agents, we evaluate the performance of mechanisms that take as input each agent's \emph{ordinal preferences}, i.e., their ranking of the items from most- to least-preferred. The…

Computer Science and Game Theory · Computer Science 2026-02-13 Ioannis Caragiannis , Vasilis Gkatzelis , Sebastian Homrighausen

Randomization is a powerful tool that endows algorithms with remarkable properties. For instance, randomized algorithms excel in adversarial settings, often surpassing the worst-case performance of deterministic algorithms with large…

Machine Learning · Computer Science 2024-08-21 Johannes von Oswald , Seijin Kobayashi , Yassir Akram , Angelika Steger

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

Realism constraints (or constraints on perceptual quality) have received considerable recent attention within the context of lossy compression, particularly of images. Theoretical studies of lossy compression indicate that high-rate common…

Information Theory · Computer Science 2025-11-20 Yassine Hamdi , Aaron B. Wagner , Deniz Gündüz

Filters in convolutional neural networks are sensitive to their initialization. The random numbers used to initialize filters are a bias and determine if you will "win" and converge to a satisfactory local minimum so we call this The Filter…

Computer Vision and Pattern Recognition · Computer Science 2017-05-30 Joseph Paul Cohen , Henry Z. Lo , Wei Ding

Under which conditions and with which distortions can we preserve the pairwise-distances of low-complexity vectors, e.g., for structured sets such as the set of sparse vectors or the one of low-rank matrices, when these are mapped in a…

Information Theory · Computer Science 2016-11-15 Laurent Jacques

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

The notion of distortion in social choice problems has been defined to measure the loss in efficiency -- typically measured by the utilitarian social welfare, the sum of utilities of the participating agents -- due to having access only to…

Computer Science and Game Theory · Computer Science 2021-03-02 Elliot Anshelevich , Aris Filos-Ratsikas , Nisarg Shah , Alexandros A. Voudouris

We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…

Probability · Mathematics 2026-03-11 Aksheytha Chelikavada , Hugo Panzo
‹ Prev 1 8 9 10 Next ›