Pages that link to "Item:Q2256717"

The following pages link to Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717):

Displaying 18 items.

• The complexity of priced control in elections (Q314424) (← links)
• Campaign management under approval-driven voting rules (Q513294) (← links)
• Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
• Algorithms for gerrymandering over graphs (Q831130) (← links)
• Optimal defense against election control by deleting voter groups (Q1647508) (← links)
• Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
• Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718) (← links)
• Backdoors to planning (Q2321271) (← links)
• Combinatorial voter control in elections (Q2346381) (← links)
• The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
• Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
• Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
• On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
• Isomorphic Distances Among Elections (Q5042228) (← links)
• The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters (Q5042253) (← links)
• The possible winner with uncertain weights problem (Q6133655) (← links)
• Compromising as an equal loss principle (Q6172228) (← links)