Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
From MaRDI portal
Recommendations
- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
- Exact analysis of Dodgson elections
- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
- Approximability of Dodgson's rule
- Socially desirable approximations for dodgson’s voting rule
Cites work
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- scientific article; zbMATH DE number 3876622 (Why is no real title available?)
- scientific article; zbMATH DE number 1008518 (Why is no real title available?)
- scientific article; zbMATH DE number 1072538 (Why is no real title available?)
- scientific article; zbMATH DE number 1947423 (Why is no real title available?)
- scientific article; zbMATH DE number 2080215 (Why is no real title available?)
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- scientific article; zbMATH DE number 1759396 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A Tight Analysis of the Greedy Algorithm for Set Cover
- Approximate solution of NP optimization problems
- Average Case Complete Problems
- Bounded Query Classes
- Canonical Coin Changing and Greedy Solutions
- Exact analysis of Dodgson elections
- Exact complexity of the winner problem for Young elections
- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
- How hard is bribery in elections?
- Independence of clones as a criterion for voting rules
- Integer Programming with a Fixed Number of Variables
- Introduction to algorithms
- Junta distributions and the average-case complexity of manipulating elections
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- More complicated questions about maxima and minima, and some closures of NP
- On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
- On Worst‐Case to Average‐Case Reductions for NP Problems
- Smoothed analysis of algorithms
- The Boolean Hierarchy I: Structural Properties
- The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
- The complexity of Kemeny elections
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The strong exponential hierarchy collapses
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(15)- Generalized juntas and NP-hard sets
- Parameterized computational complexity of Dodgson and Young elections
- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
- Proportional approval voting, harmonic \(k\)-median, and negative association
- The complexity of online bribery in sequential elections
- Exact analysis of Dodgson elections
- Approximability of Dodgson's rule
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
- Socially desirable approximations for dodgson’s voting rule
- Computational Aspects of Approval Voting
- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
- Beyond the worst case: semi-random complexity analysis of winner determination
- On the approximability of Dodgson and Young elections
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
This page was built for publication: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835761)
