Exact complexity of the winner problem for Young elections
From MaRDI portal
Publication:1405784
DOI10.1007/s00224-002-1093-zzbMath1061.90084arXivcs/0112021OpenAlexW1646465584MaRDI QIDQ1405784
Jörg Vogel, Holger Spakowski, Jörg Rothe
Publication date: 26 August 2003
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0112021
Related Items (31)
On stable rules for selecting committees ⋮ 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 ⋮ Dichotomy for voting systems ⋮ The complexity of probabilistic lobbying ⋮ A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison ⋮ The complexity of computing minimal unidirectional covering sets ⋮ A distance-based comparison of basic voting rules ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ 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 ⋮ Rationalizations of Condorcet-consistent rules via distances of Hamming type ⋮ The Complexity Landscape of Outcome Determination in Judgment Aggregation ⋮ Voting Procedures, Complexity of ⋮ On complexity of lobbying in multiple referenda ⋮ Complexity of stability ⋮ Minimal envy and popular matchings ⋮ Complexity of Stability. ⋮ On the approximability of Dodgson and Young elections ⋮ Parameterized computational complexity of Dodgson and Young elections ⋮ Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP ⋮ Hybrid Elections Broaden Complexity-Theoretic Resistance to Control ⋮ Computational Aspects of Approval Voting ⋮ Anyone but him: the complexity of precluding an alternative ⋮ Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results ⋮ The complexity of Kemeny elections
This page was built for publication: Exact complexity of the winner problem for Young elections
