Pages that link to "Item:Q1200886"

The following pages link to How hard is it to control an election? (Q1200886):

Displaying 26 items.

• Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
• On complexity of lobbying in multiple referenda (Q2463791) (← links)
• Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
• Group control for consent rules with consecutive qualifications (Q2682019) (← links)
• The nonmanipulative vote-deficits of voting rules (Q2695443) (← links)
• Computational Aspects of Approval Voting (Q2829683) (← links)
• Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
• Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
• Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control (Q3392309) (← links)
• Copeland Voting Fully Resists Constructive Control (Q3511426) (← links)
• Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control (Q3599137) (← links)
• Condorcet-consistent and approximately strategyproof tournament rules (Q4638087) (← links)
• Isomorphic Distances Among Elections (Q5042228) (← links)
• The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters (Q5042253) (← links)
• Duplication monotonicity in the allocation of indivisible goods (Q5145454) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)
• Bribery and Control in Stable Marriage (Q5154751) (← links)
• Network-Based Vertex Dissolution (Q5254088) (← links)
• Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems (Q5505642) (← links)
• Obtaining a proportional allocation by deleting items (Q5925523) (← links)
• Priced gerrymandering (Q6093576) (← links)
• The possible winner with uncertain weights problem (Q6133655) (← links)
• Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas (Q6178460) (← links)
• Primarily about primaries (Q6494383) (← links)