Recognizing single-peaked preferences on a tree
From MaRDI portal
Publication:1122456
DOI10.1016/0165-4896(89)90060-7zbMath0675.90006OpenAlexW2068950151MaRDI QIDQ1122456
Publication date: 1989
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: http://purl.umn.edu/4748
Related Items (9)
Testing a mixture model of single-peaked preferences ⋮ A characterization of the single-peaked domain ⋮ The shield that never was: societies with single-peaked preferences are more open to manipulation and control ⋮ Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms ⋮ Single peaked domains with tree-shaped spectra ⋮ Exact algorithms for weighted and unweighted Borda manipulation problems ⋮ Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs ⋮ Structured preferences: a literature survey ⋮ Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results
Cites Work
- Unnamed Item
- Packing and covering a tree by subtrees
- Single-peaked orders on a tree
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Stable matching with preferences derived from a psychological model
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Doubly Lexical Orderings of Matrices
- The Simple Majority Decision Rule
This page was built for publication: Recognizing single-peaked preferences on a tree
