Preferences single-peaked on a tree: multiwinner elections and structural results
From MaRDI portal
(Redirected from Publication:5026258)
Recommendations
- Recognizing single-peaked preferences on a tree
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
- Preferences Single-Peaked on a Circle
- Bounded single-peaked width and proportional representation
- On the complexity of Chamberlin-Courant on almost structured profiles
Cites work
- scientific article; zbMATH DE number 4173000 (Why is no real title available?)
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- scientific article; zbMATH DE number 1375584 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- A Polynomial Time Algorithm for Unidimensional Unfolding Representations
- A review of tree convex sets test
- An Exploration in the Theory of Optimum Income Taxation
- Bounded single-peaked width and proportional representation
- Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates
- Clustering to minimize the maximum intercluster distance
- Condorcet domains, median graphs and the single-crossing property
- Decomposing combinatorial auctions and set packing problems
- Eliciting single-peaked preferences using comparison queries
- Exact algorithms and applications for tree-like Weighted Set Cover
- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
- Exact complexity of the winner problem for Young elections
- Handbook of social choice and welfare. Vol. 1.
- Incomplete preferences in single-peaked electorates
- On the complexity of achieving proportional representation
- On the computation of fully proportional representation
- Preferences Single-Peaked on a Circle
- Recognizing single-peaked preferences on a tree
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
- Reducibility among combinatorial problems
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Single-peaked orders on a tree
- Sorting out single-crossing preferences on networks
- Stable matching with preferences derived from a psychological model
- Strategy-proof location on a network
- The complexity of Kemeny elections
- The complexity of fully proportional representation for single-crossing electorates
- The structure of non-manipulable social choice rules on a tree
- Unanimous and strategy-proof probabilistic rules for single-peaked preference profiles on graphs
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(13)- Bounded single-peaked width and proportional representation
- On the complexity of Chamberlin-Courant on almost structured profiles
- The complexity of fully proportional representation for single-crossing electorates
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
- The complexity of fully proportional representation for single-crossing electorates
- Are there any nicely structured preference profiles nearby?
- Condorcet domains on at most seven alternatives
- SINGLE PEAKED FUZZY PREFERENCES IN ONE-DIMENSIONAL MODELS: DOES BLACK'S MEDIAN VOTER THEOREM HOLD?
- Recognizing single-peaked preferences on a tree
- Preference elicitation and robust winner determination for single- and multi-winner social choice
- Contraction consistent aggregation on trees
- OWA-based extensions of the Chamberlin-Courant rule
- Structured preferences: a literature survey
This page was built for publication: Preferences single-peaked on a tree: multiwinner elections and structural results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026258)
