Related papers: The Distortion of Binomial Voting Defies Expectation

Related papers

Proportionality in Thumbs Up and Down Voting [20.84797796151438]
We propose two conceptually distinct approaches to interpret proportionality in the presence of up and down votes. The first approach treats the satisfaction from electing candidates as comparable, leading to combined proportionality guarantees. The second approach considers veto power separately, introducing guarantees distinct from traditional proportionality.
arXiv Detail & Related papers (2025-03-03T19:02:37Z)
Verifying Proportionality in Temporal Voting [29.69443607539022]
We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates. We focus on the complexity of verifying whether a given outcome offers proportional representation.
arXiv Detail & Related papers (2025-02-09T16:30:34Z)
Efficient Lower Bounding of Single Transferable Vote Election Margins [56.12949230611067]
Single transferable vote (STV) is a system of preferential proportional voting employed in multi-seat elections. The margin of victory, or simply'margin', is the smallest number of ballots that need to be manipulated to alter the set of winners. Lower bounds on the margin can also be used for this purpose, in cases where exact margins are difficult to compute.
arXiv Detail & Related papers (2025-01-24T13:39:23Z)
Optimal bounds for dissatisfaction in perpetual voting [84.02572742131521]
We consider a perpetual approval voting method that guarantees that no voter is dissatisfied too many times. We identify a sufficient condition on voter behavior under which a sublinear growth of dissatisfaction is possible. We present a voting method with sublinear guarantees on dissatisfaction under bounded conflicts, based on the standard techniques from prediction with expert advice.
arXiv Detail & Related papers (2024-12-20T19:58:55Z)
DeepVoting: Learning Voting Rules with Tailored Embeddings [13.037431161285971]
We recast the problem of designing a good voting rule into one of learning probabilistic versions of voting rules. We show that embeddings of preference profiles derived from the social choice literature allows us to learn existing voting rules more efficiently. We also show that rules learned using embeddings can be tweaked to create novel voting rules with improved axiomatic properties.
arXiv Detail & Related papers (2024-08-24T17:15:20Z)
Average-Case Analysis of Iterative Voting [33.68929251752289]
Iterative voting is a natural model of repeated strategic decision-making in social choice. Prior work has analyzed the efficacy of iterative plurality on the welfare of the chosen outcome at equilibrium. This work extends average-case analysis to a wider class of distributions and distinguishes when iterative plurality improves or degrades welfare.
arXiv Detail & Related papers (2024-02-13T00:46:46Z)
The Decisive Power of Indecision: Low-Variance Risk-Limiting Audits and Election Contestation via Marginal Mark Recording [51.82772358241505]
Risk-limiting audits (RLAs) are techniques for verifying the outcomes of large elections. We define new families of audits that improve efficiency and offer advances in statistical power. New audits are enabled by revisiting the standard notion of a cast-vote record so that it can declare multiple possible mark interpretations.
arXiv Detail & Related papers (2024-02-09T16:23:54Z)
Fairly Allocating Utility in Constrained Multiwinner Elections [0.0]
A common denominator to ensure fairness across all such contexts is the use of constraints. Across these contexts, the candidates selected to satisfy the given constraints may systematically lead to unfair outcomes for historically disadvantaged voter populations. We develop a model to select candidates that satisfy the constraints fairly across voter populations.
arXiv Detail & Related papers (2022-11-23T10:04:26Z)
Bounding Counterfactuals under Selection Bias [60.55840896782637]
We propose a first algorithm to address both identifiable and unidentifiable queries. We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal.
arXiv Detail & Related papers (2022-07-26T10:33:10Z)
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning [58.23459346724491]
We use the "map of elections" approach of Szufa et al. (AAMAS 2020) to analyze several well-known vote distributions. We draw the "skeleton map" of distributions, evaluate its robustness, and analyze its properties.
arXiv Detail & Related papers (2022-05-16T17:40:22Z)
The Impact of a Coalition: Assessing the Likelihood of Voter Influence in Large Elections [30.930621357547487]
It has been widely believed that the influence of a small coalition of voters is negligible in a large election. We show that the likelihood is $Thetaleft(minleftfracBsqrt n, 1rightright)$ for many commonly-studied voting rules.
arXiv Detail & Related papers (2022-02-13T21:27:22Z)
Obvious Manipulability of Voting Rules [105.35249497503527]
The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability.
arXiv Detail & Related papers (2021-11-03T02:41:48Z)
Assertion-Based Approaches to Auditing Complex Elections, with Application to Party-List Proportional Elections [21.883045335485317]
We show that assertions with linear dependence on transformations of the votes can easily be transformed to canonical form for SHANGRLA. We illustrate the approach by constructing assertions for party-list elections using the D'Hondt method.
arXiv Detail & Related papers (2021-07-25T22:52:49Z)
Mundus vult decipi, ergo decipiatur: Visual Communication of Uncertainty in Election Polls [56.8172499765118]
We discuss potential sources of bias in nowcasting and forecasting. Concepts are presented to attenuate the issue of falsely perceived accuracy. One key idea is the use of Probabilities of Events instead of party shares.
arXiv Detail & Related papers (2021-04-28T07:02:24Z)
Distributionally Robust Bayesian Quadrature Optimization [60.383252534861136]
We study BQO under distributional uncertainty in which the underlying probability distribution is unknown except for a limited set of its i.i.d. samples. A standard BQO approach maximizes the Monte Carlo estimate of the true expected objective given the fixed sample set. We propose a novel posterior sampling based algorithm, namely distributionally robust BQO (DRBQO) for this purpose.
arXiv Detail & Related papers (2020-01-19T12:00:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.