Pages that link to "Item:Q513294"

The following pages link to Campaign management under approval-driven voting rules (Q513294):

Displaying 10 items.

• On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
• Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
• Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
• Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
• The complexity of online bribery in sequential elections (Q2121471) (← 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)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• How hard is safe bribery? (Q6057829) (← links)