Exact analysis of Dodgson elections
From MaRDI portal
Publication:4208875
DOI10.1145/268999.269002zbMath0904.68111OpenAlexW2066051963MaRDI QIDQ4208875
Jörg Rothe, Hemaspaandra, Lane A., Edith Hemaspaandra
Publication date: 4 November 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/
Voting theory (91B12) Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
On stable rules for selecting committees, Isomorphic Distances Among Elections, Guarantees for the success frequency of an algorithm for finding Dodgson-election winners, 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, Studies in Computational Aspects of Voting, Control of Condorcet voting: complexity and a relation-algebraic approach, Weighted Boolean Formula Games, Dichotomy for voting systems, The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders, The complexity of probabilistic lobbying, Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP, A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison, The complexity of computing minimal unidirectional covering sets, On the graph Laplacian and the rankability of data, Comparing multiagent systems research in combinatorial auctions and voting, Distance rationalization of voting rules, Optimal social choice functions: a utilitarian view, Stability, vertex stability, and unfrozenness for special graph classes, Beyond the worst case: semi-random complexity analysis of winner determination, Parameterized Computational Complexity of Dodgson and Young Elections, Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey, Unnamed Item, Unnamed Item, On the complexity of bribery with distance restrictions, The computational complexity of weak saddles, Manipulation can be hard in tractable voting systems even for constant-sized coalitions, The Complexity Landscape of Outcome Determination in Judgment Aggregation, The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders, Voting Procedures, Complexity of, On complexity of lobbying in multiple referenda, Complexity of stability, Predicting winner and estimating margin of victory in elections using sampling, Complexity of Stability., On the approximability of Dodgson and Young elections, Parameterized computational complexity of Dodgson and Young elections, Isomorphic implication, Frequency of correctness versus average polynomial time, Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP, Deciding According to the Shortest Computations, Hybrid Elections Broaden Complexity-Theoretic Resistance to Control, Some Remarks on Dodgson's Voting Rule, Approximability of Dodgson's rule, Computational Aspects of Approval Voting, Anyone but him: the complexity of precluding an alternative, Socially desirable approximations for dodgson’s voting rule, Structural control in weighted voting games, The complexity of Kemeny elections
