Recognizing single-peaked preferences on a tree

DOI10.1016/0165-4896(89)90060-7MaRDI QIDQ1122456zbMATH OpenOpenAlexFDO

Authors Michael A. Trick

Publication date 1989

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL http://purl.umn.edu/4748

zbMATH Keywords

Condorcet winnerelectionsingle-peaked preferencestreevoting

Mathematics Subject Classification ID

Social choice (91B14)

Recommendations

• Preferences single-peaked on a tree: multiwinner elections and structural results
• Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
• Preferences Single-Peaked on a Circle
• It is difficult to tell if there is a Condorcet spanning tree
• Incomplete preferences in single-peaked electorates

Cites work

• Doubly Lexical Orderings of Matrices
• scientific article; zbMATH DE number 3148878 (Why is no real title available?)
• On the Desirability of Acyclic Database Schemes
• Packing and covering a tree by subtrees
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Single-peaked orders on a tree
• 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 Simple Majority Decision Rule

Cited in

(13)

• Testing a mixture model of single-peaked preferences
• Single peaked domains with tree-shaped spectra
• Structured preferences: a literature survey
• Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
• Recognizing 1-Euclidean preferences: an alternative approach
• Unanimous and strategy-proof probabilistic rules for single-peaked preference profiles on graphs
• Preferences single-peaked on a tree: multiwinner elections and structural results
• Preferences Single-Peaked on a Circle
• Recognizing top-monotonic preference profiles in polynomial time
• Exact algorithms for weighted and unweighted Borda manipulation problems
• Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
• A characterization of the single-peaked domain
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control

This page was built for publication: Recognizing single-peaked preferences on a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122456)