Pages that link to "Item:Q2957899"
From MaRDI portal
The following pages link to Search versus Decision for Election Manipulation Problems (Q2957899):
Displaying 16 items.
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- 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)
- 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)
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
- The computational difficulty of manipulating an election (Q1824524) (← 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)
- Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
- Pseudo-deterministic Proofs (Q4993280) (← links)
- Search versus Decision for Election Manipulation Problems (Q5053055) (← links)
- The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
- Hardness and algorithms for electoral manipulation under media influence (Q6113911) (← links)