Pages that link to "Item:Q490458"

The following pages link to The complexity of manipulative attacks in nearly single-peaked electorates (Q490458):

Displaying 17 items.

• Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
• Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
• Campaign management under approval-driven voting rules (Q513294) (← links)
• The complexity of controlling candidate-sequential elections (Q526900) (← links)
• The likelihood of single-peaked preferences under classic and new probability distribution assumptions (Q826624) (← links)
• Testing a mixture model of single-peaked preferences (Q1642168) (← links)
• On the likelihood of single-peaked preferences (Q1704048) (← links)
• On the complexity of bribery with distance restrictions (Q1713407) (← links)
• Structured preferences: a literature survey (Q2096158) (← links)
• A characterization of the single-peaked single-crossing domain (Q2179455) (← 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)
• Are there any nicely structured preference profiles nearby? (Q2634484) (← links)
• How hard is safe bribery? (Q6057829) (← links)
• Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (Q6124439) (← links)