Pages that link to "Item:Q656582"

The following pages link to Parameterized complexity of control problems in Maximin election (Q656582):

Displaying 14 items.

• Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
• The complexity of priced control in elections (Q314424) (← links)
• Normalized range voting broadly resists control (Q385502) (← links)
• Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems (Q391210) (← links)
• Optimal defense against election control by deleting voter groups (Q1647508) (← links)
• A parameterized perspective on protecting elections (Q2034407) (← links)
• Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
• Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
• Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← 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)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)