Pages that link to "Item:Q627120"
From MaRDI portal
The following pages link to The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120):
Displaying 28 items.
- The complexity of priced control in elections (Q314424) (← 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)
- Campaign management under approval-driven voting rules (Q513294) (← 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)
- Optimal defense against election control by deleting voter groups (Q1647508) (← links)
- On the likelihood of single-peaked preferences (Q1704048) (← links)
- On the complexity of bribery with distance restrictions (Q1713407) (← links)
- Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Structured preferences: a literature survey (Q2096158) (← links)
- A characterization of the single-peaked single-crossing domain (Q2179455) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Are there any nicely structured preference profiles nearby? (Q2634484) (← links)
- Group control for consent rules with consecutive qualifications (Q2682019) (← links)
- (Q5015388) (← links)
- Exact algorithms for weighted and unweighted Borda manipulation problems (Q5964076) (← links)
- Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas (Q6178460) (← links)
- Resilient heuristic aggregation of judgments in the pairwise comparisons method (Q6180002) (← links)
- Structure of single-peaked preferences (Q6195534) (← links)
- Recovering single-crossing preferences from approval ballots (Q6609139) (← links)