Pages that link to "Item:Q3645307"
From MaRDI portal
The following pages link to The Complexity of Probabilistic Lobbying (Q3645307):
Displayed 4 items.
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- Bribery in voting with CP-nets (Q2436697) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)