Pages that link to "Item:Q1759677"

The following pages link to Multivariate complexity analysis of Swap Bribery (Q1759677):

Displaying 20 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)
• On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
• Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
• Campaign management under approval-driven voting rules (Q513294) (← links)
• Frugal bribery in voting (Q527399) (← links)
• Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Local distance constrained bribery in voting (Q2215965) (← links)
• Approximation and hardness of shift-Bribery (Q2238694) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• Parameterized resiliency problems (Q2330129) (← links)
• Bribery in voting with CP-nets (Q2436697) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• (Q5111743) (← links)
• Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
• Robustness among multiwinner voting rules (Q5918366) (← links)
• Exact algorithms for weighted and unweighted Borda manipulation problems (Q5964076) (← links)
• How hard is safe bribery? (Q6057829) (← links)
• The possible winner with uncertain weights problem (Q6133655) (← links)