Pages that link to "Item:Q1200886"
From MaRDI portal
The following pages link to How hard is it to control an election? (Q1200886):
Displayed 41 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)
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- Solving hard control problems in voting systems via integer programming (Q322433) (← links)
- Computational complexity of manipulation: a survey (Q334204) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Normalized range voting broadly resists control (Q385502) (← 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)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← 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)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- Generalized juntas and NP-hard sets (Q837194) (← links)
- The learnability of voting rules (Q840821) (← links)
- Vote trading in public elections (Q855754) (← links)
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461) (← links)
- On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- Parameterized computational complexity of control problems in voting systems (Q1029347) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- On complexity of lobbying in multiple referenda (Q2463791) (← links)
- Computational Aspects of Approval Voting (Q2829683) (← links)
- Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control (Q3392309) (← links)
- Copeland Voting Fully Resists Constructive Control (Q3511426) (← links)
- Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control (Q3599137) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems (Q5505642) (← links)