The following pages link to (Q3112639):
Displaying 14 items.
- The complexity of priced control in elections (Q314424) (← links)
- Solving hard control problems in voting systems via integer programming (Q322433) (← links)
- New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
- Consistency of scoring rules: a reinvestigation of composition-consistency (Q2021826) (← links)
- Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Condorcet domains, median graphs and the single-crossing property (Q2323590) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Exact algorithms for weighted and unweighted Borda manipulation problems (Q5964076) (← links)
- Multiple votes, multiple candidacies and polarization (Q5964641) (← links)
- The possible winner with uncertain weights problem (Q6133655) (← links)
