The following pages link to Bribery in voting with CP-nets (Q2436697):
Displayed 8 items.
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Expressive efficiency of two kinds of specific CP-nets (Q527168) (← links)
- Frugal bribery in voting (Q527399) (← links)
- On the complexity of bribery with distance restrictions (Q1713407) (← links)
- Local distance constrained bribery in voting (Q2215965) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets (Q3460798) (← links)
- How hard is safe bribery? (Q6057829) (← links)