Portal de Periódicos da CAPES

Single-peaked orders on a tree

1982; Elsevier BV; Volume: 3; Issue: 4 Linguagem: Inglês

10.1016/0165-4896(82)90020-8

1879-3118

Gabrielle Demange,

Complexity and Algorithms in Graphs

Inada (1969) and Sen and Pattanaik (1969) have characterized the sets of preference orders which ensure the transitivity of the strict majority rule, no matter how each voter selects his own order in the set. But a problem remains untouched: which domains of orders guarantee the existence of a majority winner without necessarily ensuring the transitivity of the strict majority rule. We provide in this paper domains, called sets of single-peaked linear orders on a tree, which enjoy such a property. They appear as a generalization of the well-known sets of single-peaked linear orders.