Pages that link to "Item:Q2800947"
From MaRDI portal
The following pages link to Large-scale election campaigns: combinatorial shift bribery (Q2800947):
Displaying 14 items.
- The complexity of priced control in elections (Q314424) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Protecting elections by recounting ballots (Q2046043) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- Exploiting social influence to control elections based on positional scoring rules (Q2105422) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
- Local distance constrained bribery in voting (Q2215965) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
- How Hard Is Bribery in Elections? (Q3651470) (← links)
- Computational complexity characterization of protecting elections from bribery (Q5919119) (← links)