Single-peaked orders on a tree - HAL Accéder directement au contenu
Article dans une revue Mathematical Social Sciences Année : 1982

Single-peaked orders on a tree

Résumé

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.
Loading...
Fichier non déposé

Dates et versions

halshs-00671003, version 1 (16-02-2012)

Identifiants

  • HAL Id : halshs-00671003 , version 1

Citer

Gabrielle Demange. Single-peaked orders on a tree. Mathematical Social Sciences, 1982, 3 (4), pp.389-396. ⟨halshs-00671003⟩
197 Consultations
0 Téléchargements
Dernière date de mise à jour le 05/05/2024
comment ces indicateurs sont-ils produits

Partager

Gmail Facebook Twitter LinkedIn Plus