Exact analysis of Dodgson elections
From MaRDI portal
Recommendations
- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
- Voting schemes for which it can be difficult to tell who won the election
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- Exact complexity of the winner problem for Young elections
- The complexity of Kemeny elections
Cited in
(55)- Approximability of Dodgson's rule
- Anyone but him: the complexity of precluding an alternative
- Voting schemes for which it can be difficult to tell who won the election
- Exact complexity of the winner problem for Young elections
- The complexity of probabilistic lobbying
- On the complexity of bribery with distance restrictions
- On the approximability of Dodgson and Young elections
- Structural control in weighted voting games
- On the graph Laplacian and the rankability of data
- Complexity of stability
- Predicting winner and estimating margin of victory in elections using sampling
- Parameterized computational complexity of Dodgson and Young elections
- Isomorphic implication
- On stable rules for selecting committees
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- On complexity of lobbying in multiple referenda
- Computational Aspects of Approval Voting
- Studies in Computational Aspects of Voting
- Lewis Carroll, voting, and the taxicab metric
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Deciding according to the shortest computations
- Manipulation complexity of same-system runoff elections
- The complexity of priced control in elections
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games
- Control of Condorcet voting: complexity and a relation-algebraic approach
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Some Remarks on Dodgson's Voting Rule
- Weighted Boolean formula games
- Parameterized Computational Complexity of Dodgson and Young Elections
- scientific article; zbMATH DE number 1759396 (Why is no real title available?)
- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions
- Single-peaked consistency for weak orders is easy
- scientific article; zbMATH DE number 7450032 (Why is no real title available?)
- Isomorphic Distances Among Elections
- The complexity landscape of outcome determination in judgment aggregation
- Voting procedures, complexity of
- Socially desirable approximations for dodgson’s voting rule
- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
- Complexity of Stability.
- Stability, vertex stability, and unfrozenness for special graph classes
- Beyond the worst case: semi-random complexity analysis of winner determination
- Comparing multiagent systems research in combinatorial auctions and voting
- The computational complexity of weak saddles
- Collective decision making
- Drawing a map of elections
- The complexity of Kemeny elections
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- Dichotomy for voting systems
- Distance rationalization of voting rules
- Optimal social choice functions: a utilitarian view
- Frequency of correctness versus average polynomial time
This page was built for publication: Exact analysis of Dodgson elections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4208875)
