Pages that link to "Item:Q906403"
From MaRDI portal
The following pages link to Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403):
Displaying 14 items.
- Frugal bribery in voting (Q527399) (← links)
- Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403) (← links)
- Manipulative elicitation -- a new attack on elections with incomplete preferences (Q1637215) (← links)
- Complexity of manipulation with partial information in voting (Q1743720) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- On the exact amount of missing information that makes finding possible winners hard (Q2698287) (← links)
- (Q4583963) (← links)
- On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard (Q5111273) (← links)
- How hard is safe bribery? (Q6057829) (← links)