Arrow and Raynaud introduced a set of axioms that a ranking rule should verify. Among these, axiom V' states that the compromise ranking should be a so-called prudent order. Intuitively, a prudent order is a linear order such that the strongest opposition against this solution is minimal. Since the related literature lacks in solid theoretical foundations for this type of aggregation rule, it was our main objective in this thesis to thoroughly study and gain a better understanding of the family of prudent ranking rules. We provide characterizations of several prudent ranking rules in a conjoint axiomatic framework. We also prove that we can construct profiles for which the result of a prudent ranking rule and a non-prudent ranking rule can be contradictory. Finally we illustrate the use of prudent ranking rules in a group decision context and on the composite indicator problem.<p><p> / Doctorat en Sciences de l'ingénieur / info:eu-repo/semantics/nonPublished
| Identifer | oai:union.ndltd.org:ulb.ac.be/oai:dipot.ulb.ac.be:2013/210662 |
| Date | 03 October 2007 |
| Creators | Lamboray, Claude |
| Contributors | Vincke, Philippe, Bisdorff, Raymond, Mareschal, Bertrand, Pirlot, Marc, Marchant, Thierry, Van Ham, Philippe |
| Publisher | Universite Libre de Bruxelles, Université libre de Bruxelles, Faculté des sciences appliquées – Mathématiques, Bruxelles |
| Source Sets | Université libre de Bruxelles |
| Language | French |
| Detected Language | English |
| Type | info:eu-repo/semantics/doctoralThesis, info:ulb-repo/semantics/doctoralThesis, info:ulb-repo/semantics/openurl/vlink-dissertation |
| Format | 1 v., No full-text files |
Page generated in 0.0021 seconds