Single-peaked compatible preference profiles: some combinatorial results
This paper examines combinatorial problems in connection with single-peaked preference orderings on a unidimensional scale. A binary relation, dominance, is defined on the set of connected orderings. Relevant properties of the corresponding poset and cover graph are discussed. A formula for the number of pairs of connected orderings consistent with spatial single-peakedness is derived. The total n
