Pages that link to "Item:Q2962574"
From MaRDI portal
The following pages link to Computational Aspects of Nearly Single-Peaked Electorates (Q2962574):
Displaying 12 items.
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- On the likelihood of single-peaked preferences (Q1704048) (← links)
- Structured preferences: a literature survey (Q2096158) (← links)
- Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- Are there any nicely structured preference profiles nearby? (Q2634484) (← links)
- Group control for consent rules with consecutive qualifications (Q2682019) (← links)
- Measuring nearly single-peakedness of an electorate: some new insights (Q2695423) (← links)
- Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (Q2941740) (← links)
- Manipulation of k-Approval in Nearly Single-Peaked Electorates (Q3449523) (← links)
- Toward Computing the Margin of Victory in Single Transferable Vote Elections (Q5139621) (← links)
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (Q6124439) (← links)
