Single-peaked consistency for weak orders is easy
From MaRDI portal
Publication:5015388
Recommendations
Cites work
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- scientific article; zbMATH DE number 3400720 (Why is no real title available?)
- A Polynomial Time Algorithm for Unidimensional Unfolding Representations
- A characterization of the single-crossing domain
- A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
- An Exploration in the Theory of Optimum Income Taxation
- Exact analysis of Dodgson elections
- Incidence matrices and interval graphs
- Stable matching with preferences derived from a psychological model
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The complexity of Kemeny elections
- The complexity of manipulative attacks in nearly single-peaked electorates
- The computational impact of partial votes on strategic voting
- The original Borda count and partial voting
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- Top monotonicity: a common root for single peakedness, single crossing and the median voter result
Cited in
(7)- Asymmetric single-peaked preferences
- Recovering single-crossing preferences from approval ballots
- Bisymmetric and quasitrivial operations: characterizations and enumerations
- Single-peaked compatible preference profiles: Some combinatorial results
- Quasitrivial semigroups: characterizations and enumerations
- Incomplete preferences in single-peaked electorates
- Testing a mixture model of single-peaked preferences
This page was built for publication: Single-peaked consistency for weak orders is easy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015388)