NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.078 seconds)

Spelling suggestions: "subject:"prudent orders"" "subject:"erudent orders""

1

Prudent ranking rules: theoretical contributions and applications

Lamboray, Claude 03 October 2007 (has links)
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.
Prudent orders
Ranking rules
Axiomatisations
Group Decisions
Composite Indicators
2

Prudent ranking rules: theoretical contributions and applications

Lamboray, Claude 03 October 2007 (has links)
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
Sciences de l'ingénieur
Mathématiques
Search theory
Decision making
Multiple criteria decision making
Décision, Théorie de la
Prise de décision
Décision multicritère
Prudent orders
Ranking rules
Axiomatisations
Group Decisions
Composite Indicators

Page generated in 0.0812 seconds