Conference program design with single-peaked and single-crossing preferences
From MaRDI portal
Recommendations
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
- The complexity of fully proportional representation for single-crossing electorates
- Bounded single-peaked width and proportional representation
- Preferences Single-Peaked on a Circle
- The complexity of fully proportional representation for single-crossing electorates
Cites work
- A constant factor approximation algorithm for fault-tolerant k-median
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Majority voting on restricted domains
- Manipulation of k-Approval in Nearly Single-Peaked Electorates
- On the complexity of achieving proportional representation
- On the computation of fully proportional representation
- On the power of deterministic mechanisms for facility location games
- Precoloring extension on unit interval graphs
- The complexity of fully proportional representation for single-crossing electorates
Cited in
(3)
This page was built for publication: Conference program design with single-peaked and single-crossing preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959832)