Pages that link to "Item:Q3392307"

The following pages link to Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307):

Displaying 20 items.

• The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
• Normalized range voting broadly resists control (Q385502) (← 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)
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← 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)
• Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
• Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
• Optimal defense against election control by deleting voter groups (Q1647508) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• A parameterized perspective on protecting elections (Q2034407) (← links)
• The complexity of online bribery in sequential elections (Q2121471) (← 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)
• Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
• Computational Aspects of Approval Voting (Q2829683) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)