paper-with-me

홈 › Papers

Probabilistic Fixed Ballot Rules and Hybrid Domains

2021-05-22 · Shurojit Chatterji, Souvik Roy, Soumyarup Sadhukhan, Arunava Sen, Huaxia Zeng

We study a class of preference domains that satisfies the familiar properties of minimal richness, diversity and no-restoration. We show that a specific preference restriction, hybridness, has been embedded in these domains so that the preferences are single-peaked at the "extremes" and unrestricted in the "middle". We also study the structure of strategy-proof and unanimous Random Social Choice Functions on these domains. We show them to be special cases of probabilistic fixed ballot rules (introduced by Ehlers, Peters, and Storcken (2002)).

📄 PDF Abstract BibTeX arXiv:2105.10677

Code (0)

등록된 구현이 없습니다.

Tasks

Diversity

Similar Papers 제목 키워드 기반

Computational Aspects of Multi-Winner Approval Voting

2014-07-11 · Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie 외

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 voti…

Analyzing Physical Adversarial Example Threats to Machine Learning in Election Systems

2026-02-28 · Khaleque Md Aashiq Kamal, Surya Eada, Aayushi Verma, Subek Acharya 외 arxiv

Developments in the machine learning voting domain have shown both promising results and risks. Trained models perform well on ballot classification tasks (> 99% accuracy) but are at risk from adversarial example attacks…

A General Theory of Proportionality with Additive Utilities

2026-02-09 · Piotr Skowron arxiv

We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with divers…

An Empirical Analysis of the Effect of Ballot Truncation on Ranked-Choice Electoral Outcomes

2023-06-09 · Mallory Dickerson, Erin Martin, David McCune

In ranked-choice elections voters cast preference ballots which provide a voter's ranking of the candidates. The method of ranked-choice voting (RCV) chooses a winner by using voter preferences to simulate a series of ru…

Algorithms for Structured Elections under Thiele Voting Rules

2026-07-30 · Alexandra Lassota, Krzysztof Sornat arxiv

We study the computational complexity of winner determination problems in approval-based committee elections under Thiele voting rules. These form a class of rules parameterized by a fixed weight vector that specifies ho…