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.