Recommendations
- A Richer Understanding of the Complexity of Election Systems
- scientific article; zbMATH DE number 3961287
- The paradox of multiple elections
- Elections, voting rules and paradoxical outcomes
- A strong paradox of multiple elections
- Electoral systems. Paradoxes, assumptions, and procedures
- Voting procedures, complexity of
Cites work
- A comparison of polynomial time reducibilities
- A Consistent Extension of Condorcet’s Election Principle
- Bounded Query Classes
- Exact analysis of Dodgson elections
- Exact complexity of the winner problem for Young elections
- scientific article; zbMATH DE number 2080215 (Why is no real title available?)
- scientific article; zbMATH DE number 3799016 (Why is no real title available?)
- More complicated questions about maxima and minima, and some closures of NP
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP
- Reducibility among combinatorial problems
- Social choice and individual values
- The strong exponential hierarchy collapses
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(61)- Anyone but him: the complexity of precluding an alternative
- Fixed-parameter algorithms for Kemeny rankings
- Exact complexity of the winner problem for Young elections
- The complexity of probabilistic lobbying
- Using extension sets to aggregate partial rankings in a flexible setting
- The complexity of campaigning
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- Complexity of stability
- Predicting winner and estimating margin of victory in elections using sampling
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks
- Complexity results for extensions of median orders to different types of remoteness
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison
- On complexity of lobbying in multiple referenda
- More results on the complexity of identifying problems in graphs
- Computing kemeny rankings from d-Euclidean preferences
- An algorithmic view of voting
- Comparing and aggregating partial orders with Kendall tau distances
- Studies in Computational Aspects of Voting
- 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
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
- scientific article; zbMATH DE number 7444848 (Why is no real title available?)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- The Computational Complexity of Choice Sets
- Fixed-Parameter Algorithms for Kemeny Scores
- Exact analysis of Dodgson elections
- On the computation of median linear orders, of median complete preorders and of median weak orders
- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
- Cycles and intractability in a large class of aggregation rules
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions
- Aggregation over metric spaces: proposing and voting in elections, budgeting, and legislation
- Single-peaked consistency for weak orders is easy
- Preferences single-peaked on a tree: multiwinner elections and structural results
- Isomorphic Distances Among Elections
- The network HHD: quantifying cyclic competition in trait-performance models of tournaments
- Packing Arc-Disjoint Cycles in Tournaments
- Finding Optimal Solutions With Neighborly Help.
- The complexity landscape of outcome determination in judgment aggregation
- Graph aggregation
- Voting procedures, complexity of
- Robustness among multiwinner voting rules
- Complexity of Stability.
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- On weakly and strongly popular rankings
- Recognizing when a preference system is close to admitting a master list
- The possible winner with uncertain weights problem
- Stability, vertex stability, and unfrozenness for special graph classes
- Beyond the worst case: semi-random complexity analysis of winner determination
- Finding optimal solutions with neighborly help
- Parameterized aspects of distinct Kemeny rank aggregation
- Bivariate scoring rules: unifying the characterizations of positional scoring rules and Kemeny's rule
- Parameterized aspects of distinct Kemeny rank aggregation
- Declarative approaches to outcome determination in judgment aggregation
- Average parameterization and partial kernelization for computing medians
- Rank aggregation using scoring rules
- Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- Dichotomy for voting systems
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication: The complexity of Kemeny elections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817813)
