Structure of single-peaked preferences

DOI10.1016/j.jmp.2023.102817OpenAlexW4387784371MaRDI QIDQ6195534

Alexander Karpov

Publication date: 14 March 2024

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmp.2023.102817

zbMATH Keywords

single-peakednessstructured preferencesFishburn's domain

Mathematics Subject Classification ID

Individual preferences (91B08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Condorcet domains of tiling type
• The complexity of computing the permanent
• A characterization of the single-peaked domain
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control
• Subcyclic sets of linear orders
• The likelihood of single-peaked preferences under classic and new probability distribution assumptions
• Dictatorial domains in preference aggregation
• The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
• Efficient sets, decision heuristics, and single-peaked preferences
• Measuring dimensions of belief by unidimensional unfolding
• Finding sharper distinctions for conditions of transitivity of the majority method.
• On the likelihood of single-peaked preferences
• On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles
• The single-peaked domain revisited: a simple global characterization
• Stable matching with preferences derived from a psychological model
• Maximal Condorcet domains
• Small one-dimensional Euclidean preference profiles
• Structured preferences: a literature survey
• Constructing large peak-pit Condorcet domains
• Random assignments on sequentially dichotomous domains
• A characterization of the single-peaked single-crossing domain
• Arrow on domain conditions: a fruitful road to travel
• Condorcet domains satisfying Arrow's single-peakedness
• Random assignments on preference domains with a tier structure
• The depth of a permutation.
• Acyclic sets of linear orders
• Single-peaked compatible preference profiles: Some combinatorial results
• A characterization of the single-crossing domain
• Acyclic sets of linear orders via the Bruhat orders
• Acyclic sets of linear orders: a progress report
• Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
• Eliciting Single-Peaked Preferences Using Comparison Queries
• The Complexity of Enumeration and Reliability Problems
• A Polynomial Time Algorithm for Unidimensional Unfolding Representations
• Enhancing the connections between patterns in permutations and forbidden configurations in restricted elections
• Preferences Single-Peaked on a Circle
• Recognizing Top-Monotonic Preference Profiles in Polynomial Time
• A new solution to the random assignment problem.
• Symmetric maximal Condorcet domains

This page was built for publication: Structure of single-peaked preferences