Pages that link to "Item:Q2908543"

The following pages link to Studies in Computational Aspects of Voting (Q2908543):

Displaying 15 items.

• Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
• Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
• Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403) (← 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 dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
• Combinatorial voter control in elections (Q2346381) (← links)
• Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
• Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
• Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
• Balanced stable marriage: how close is close enough? (Q5918373) (← links)
• Exact algorithms for weighted and unweighted Borda manipulation problems (Q5964076) (← links)
• Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules (Q6066767) (← links)