Pages that link to "Item:Q2354767"
From MaRDI portal
The following pages link to Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767):
Displaying 10 items.
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- Partition on trees with supply and demand: kernelization and algorithms (Q507429) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control (Q3651465) (← links)
- Approximation and Parameterized Complexity of Minimax Approval Voting (Q4558792) (← links)
- (Q5018515) (← links)