Testing a mixture model of single-peaked preferences

DOI10.1016/j.mathsocsci.2018.02.002zbMath1393.91043OpenAlexW2793128272MaRDI QIDQ1642168

Bart Smeulders

Publication date: 20 June 2018

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

Full work available at URL: https://orbi.uliege.be/handle/2268/220570

zbMATH Keywords

algorithmtreessingle-peaked preferencesordering of choice alternatives

Mathematics Subject Classification ID

Individual preferences (91B08) Graph algorithms (graph-theoretic aspects) (05C85) Social choice (91B14)

Related Items

Testing probabilistic models of choice using column generation

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal algorithm to recognize Robinsonian dissimilarities
• A lexicographic semiorder polytope and probabilistic representations of choice
• The complexity of manipulative attacks in nearly single-peaked electorates
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• A characterization of the single-peaked domain
• Recognizing one-dimensional Euclidean preference profiles
• Recognizing single-peaked preferences on a tree
• Geometric and combinatorial properties of the polytope of binary choice probabilities
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Mixtures of order matrices and generalized order matrices
• Unimodal binary distributions
• Weak order polytopes.
• The single-peaked domain revisited: a simple global characterization
• The biorder polytope
• Stable matching with preferences derived from a psychological model
• Are there any nicely structured preference profiles nearby?
• Recognizing 1-Euclidean Preferences: An Alternative Approach
• A Polynomial Time Algorithm for Unidimensional Unfolding Representations
• A Probabilistic Theory of Utility
• 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets