Recognizing single-peaked preferences on a tree

Mathematical Social Sciences

Volumn 17, Issue 3, 1989, Pages 329-334

  Trick, Michael A ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

single peaked preferences; Voting theory

Indexed keywords

EID: 45149142303     PISSN: 01654896     EISSN: None     Source Type: Journal    
DOI: 10.1016/0165-4896(89)90060-7     Document Type: Article

References (11)

1. Packing and covering a tree by subtrees
2. Stable matching with preferences derived from a psychological model
3. On the desirability of acyclic database schemes
4. Testing for the consecutive 1's property, interval graphs, and graph planarity using PQ-tree algorithms
5. Single-peaked orders on a tree
6. Outcomes of voting and planning: Condorcet, Weber and Rawls locations
7. The simple majority rule
8. Double lexical orderings of matrices
9. On strategy-proofness and single peakedness
10. Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs