Pages that link to "Item:Q901143"
From MaRDI portal
The following pages link to On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143):
Displaying 9 items.
- The complexity of priced control in elections (Q314424) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Fixing balanced knockout and double elimination tournaments (Q1711876) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis (Q2330543) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- The number of parties and decision-making in legislatures (Q2669117) (← links)
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets (Q3460798) (← links)
- Who Can Win a Single-Elimination Tournament? (Q5348496) (← links)