Single-peaked orders on a tree
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.
(This abstract was borrowed from another version of this item.)
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:3:y:1982:i:4:p:389-396. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.