arXiv · 2604.26563
A simple characterization of single-peaked domains
Abstract
This paper characterizes the single-peaked domain on a tree via the strategy-proofness of extreme rules defined on that tree. For any tree, these rules are unanimous and anonymous on any preference domain. In particular, we show that they are strategy-proof only on the single-peaked domain associated with that tree.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mihir Bhattacharya, Anup Pramanik. 2026-04-29. A simple characterization of single-peaked domains. https://arxiv.org/abs/2604.26563
Cite the original work for its findings. Save a collection to share your selection of sources.