Pages that link to "Item:Q1405784"

The following pages link to Exact complexity of the winner problem for Young elections (Q1405784):

Displaying 34 items.

• Manipulation complexity of same-system runoff elections (Q314418) (← links)
• The complexity of priced control in elections (Q314424) (← links)
• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
• Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
• The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
• Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
• The complexity of Kemeny elections (Q817813) (← links)
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
• Dichotomy for voting systems (Q859982) (← links)
• A distance-based comparison of basic voting rules (Q882604) (← links)
• Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• On the approximability of Dodgson and Young elections (Q1761290) (← links)
• Complexity of stability (Q2237893) (← links)
• Minimal envy and popular matchings (Q2242327) (← links)
• Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
• On stable rules for selecting committees (Q2358564) (← links)
• A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
• Rationalizations of Condorcet-consistent rules via distances of Hamming type (Q2450151) (← links)
• On complexity of lobbying in multiple referenda (Q2463791) (← links)
• Computational Aspects of Approval Voting (Q2829683) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
• Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
• Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)
• Exact analysis of Dodgson elections (Q4208875) (← links)
• (Q4583963) (← links)
• Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)
• The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)
• Complexity of Stability. (Q6065416) (← links)
• Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
• Beyond the worst case: semi-random complexity analysis of winner determination (Q6167260) (← links)
• Collective decision making (Q6602233) (← links)