Pages that link to "Item:Q3081454"
From MaRDI portal
The following pages link to Multimode Control Attacks on Elections (Q3081454):
Displaying 30 items.
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- The complexity of priced control in elections (Q314424) (← links)
- Solving hard control problems in voting systems via integer programming (Q322433) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems (Q391210) (← links)
- New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
- Optimal defense against election control by deleting voter groups (Q1647508) (← links)
- A geometric model of sensitivity of multistage elections to change (Q1704063) (← links)
- On the complexity of bribery with distance restrictions (Q1713407) (← links)
- Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
- Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)
- Proportional Approval Voting, Harmonic k-median, and Negative Association (Q5002696) (← links)
- The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters (Q5042253) (← links)
- Socially desirable approximations for dodgson’s voting rule (Q5501960) (← links)
- Hardness and algorithms for electoral manipulation under media influence (Q6113911) (← links)
- The possible winner with uncertain weights problem (Q6133655) (← links)