Modeling single-peakedness for votes with ties
From MaRDI portal
Publication:4583938
Recommendations
- Manipulation of k-Approval in Nearly Single-Peaked Electorates
- Computational aspects of nearly single-peaked electorates
- Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates
- The complexity of manipulative attacks in nearly single-peaked electorates
- On the likelihood of single-peaked preferences
Cited in
(5)- Computational aspects of nearly single-peaked electorates
- Incomplete preferences in single-peaked electorates
- On the likelihood of single-peaked preferences
- Measuring nearly single-peakedness of an electorate: some new insights
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
This page was built for publication: Modeling single-peakedness for votes with ties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583938)