Pages that link to "Item:Q314427"
From MaRDI portal
The following pages link to On the hardness of bribery variants in voting with CP-nets (Q314427):
Displaying 8 items.
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- Frugal bribery in voting (Q527399) (← links)
- Local distance constrained bribery in voting (Q2215965) (← links)
- Bribery in voting with CP-nets (Q2436697) (← links)
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets (Q3460798) (← links)
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control (Q3651465) (← links)
- (Q5018515) (← links)
- How hard is safe bribery? (Q6057829) (← links)