Pages that link to "Item:Q391210"
From MaRDI portal
The following pages link to Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems (Q391210):
Displaying 11 items.
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Parameterized computational complexity of control problems in voting systems (Q1029347) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718) (← links)
- Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
- Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
- Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
- The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections (Q4999224) (← links)
- Exact algorithms for weighted and unweighted Borda manipulation problems (Q5964076) (← links)