Voting schemes for which it can be difficult to tell who won the election
From MaRDI portal
Publication:1120433
Recommendations
Cites work
- A Consistent Extension of Condorcet’s Election Principle
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Condorcet Social Choice Functions
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- scientific article; zbMATH DE number 3980481 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3405712 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- The computational difficulty of manipulating an election
- The median procedure in cluster analysis and social choice theory
- The Voting Problem
- Voting Anomalies, the Number of Voters, and the Number of Alternatives
Cited in
(only showing first 100 items - show all)- On the complexity of crossings in permutations
- Approximability of Dodgson's rule
- Mining maximum consensus sequences from group ranking data
- Fixed-parameter algorithms for Kemeny rankings
- The Nakamura numbers for computable simple games
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- Discrepancies in the outcomes resulting from different voting schemes
- Three practical criteria of comparison among ordinal preference aggregating rules
- How hard is it to control an election?
- The complexity of probabilistic lobbying
- Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties
- On the complexity of bribery with distance restrictions
- Using extension sets to aggregate partial rankings in a flexible setting
- On the approximability of Dodgson and Young elections
- On the evaluation of election outcomes under uncertainty
- The computational difficulty of manipulating an election
- Approximate and dynamic rank aggregation
- On the difficulty of making social choices
- On the hardness of maximum rank aggregation problems
- Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences
- Recursive inversion models for permutations
- A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
- Byzantine preferential voting
- Predicting winner and estimating margin of victory in elections using sampling
- Parameterized computational complexity of Dodgson and Young elections
- NP-hardness results for the aggregation of linear orders into median orders
- Computer science and decision theory
- A probabilistic evaluation framework for preference aggregation reflecting group homogeneity
- A new approach for identifying the Kemeny median ranking
- Multidimensional welfare rankings under weight imprecision: a social choice perspective
- Complexity results for extensions of median orders to different types of remoteness
- Parameterized complexity of control and bribery for \(d\)-approval elections
- On stable rules for selecting committees
- Consensus functions and patterns in molecular sequences
- An algorithm for rank aggregation problem
- Label ranking by learning pairwise preferences
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Approaching the rank aggregation problem by local search-based metaheuristics
- On the complexity of achieving proportional representation
- Finding socially best spanning treesî
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- On complexity of lobbying in multiple referenda
- Computability of simple games: A characterization and application to the core
- Are there any nicely structured preference profiles nearby?
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Optimizing the cost of preference manipulation in the graph model for conflict resolution
- Voting: a machine learning approach
- Preference aggregation in the generalised unavailable candidate model
- Computing kemeny rankings from d-Euclidean preferences
- Lazy Gale-Shapley for many-to-one matching with partial information
- An algorithmic view of voting
- Computational Aspects of Approval Voting
- Comparing and aggregating partial orders with Kendall tau distances
- Parameterized complexity of control and bribery for \(d\)-approval elections
- Ranking chain sum orders
- Studies in Computational Aspects of Voting
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Ranking and drawing in subexponential time
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Partial kernelization for rank aggregation: theory and experiments
- Manipulation complexity of same-system runoff elections
- The complexity of priced control in elections
- It is difficult to tell if there is a Condorcet spanning tree
- Computational complexity of manipulation: a survey
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
- The Computational Complexity of Choice Sets
- Some Remarks on Dodgson's Voting Rule
- Prices matter for the parameterized complexity of shift bribery
- scientific article; zbMATH DE number 4138842 (Why is no real title available?)
- Fixed-Parameter Algorithms for Kemeny Scores
- Copeland Voting Fully Resists Constructive Control
- Parameterized Computational Complexity of Dodgson and Young Elections
- Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control
- Improved parameterized algorithms for the Kemeny aggregation problem
- Exact analysis of Dodgson elections
- On the computation of median linear orders, of median complete preorders and of median weak orders
- Voting with rubber bands, weights, and strings
- Experiments with Kemeny ranking: What works when?
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem
- Probabilistic preference learning with the Mallows rank model
- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
- How hard is it to tell which is a Condorcet committee?
- 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
- 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
- Randomized algorithms for lexicographic inference
- Voting procedures, complexity of
- Popular spanning trees
- Comparing and Aggregating Partially Resolved Trees
- Socially desirable approximations for dodgson’s voting rule
- Computability of simple games: a complete investigation of the sixty-four possibilities
- Median linear orders: Heuristics and a branch and bound algorithm
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
- On weakly and strongly popular rankings
- Collective schedules: axioms and algorithms
This page was built for publication: Voting schemes for which it can be difficult to tell who won the election
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120433)
