Preferences single-peaked on nice trees

Abstract

Preference profiles that are single-peaked on trees enjoy desirable properties: They admit a Condorcet winner (Demange 1982), and there are hard voting problems that become tractable on this domain (Yu, Chan, and Elkind 2013). Trick (1989) proposed a polynomial-Time algorithm that finds some tree with respect to which a given preference profile is singlepeaked. However, some voting problems are only known to be easy for profiles that are single-peaked on "nice" trees, and Trick's algorithm provides no guarantees on the properties of the tree that it outputs. To overcome this issue, we build on the work of Trick and Yu et al. to develop a structural approach that enables us to compactly represent all trees with respect to which a given profile is single-peaked. We show how to use this representation to efficiently find the "best" tree for a given profile, according to a number of criteria; for other criteria, we obtain NP-hardness results. In particular, we show that it is NP-hard to decide whether an input profile is single-peaked with respect to a given tree. To demonstrate the applicability of our framework, we use it to identify a new class of profiles that admit an efficient algorithm for a popular variant of the Chamberlin-Courant (1983) rule.