No label defined (Q3779948)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4041560
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4041560

      Statements

      0 references
      1987
      0 references
      multicriteria decision making
      0 references
      preference aggregation
      0 references
      hierarchical structures
      0 references
      overall decision
      0 references
      conflicting alternatives
      0 references
      perturbations
      0 references
      quasi-ordered sets
      0 references
      lexicographic orderings
      0 references
      [For the entire collection see Zbl 0633.00015.] The paper deals with the problem of how to take an overall decision between conflicting alternatives for which evaluations according to multiple criteria point into different directions. (Within the context of social choice for a similar problem K. J. Arrow has proved 1951 his celebrated Possibility Theorem.) It is shown that the overall decision is stable against small perturbations in the evaluations of the criteria only if the overall decision is hierarchical with respect to the criteria. More precisely, the following theorem is proven. Theorem. Suppose each of the quasi-ordered sets \((X_ i,\leq_ i)\), \(i=1,...,n\), possesses at least 3 indifference classes. Then a quasi- ordering on \(X=\prod^{n}_{i=1}\) is stable if and only if it is hierarchical or it is trivial. The assumptions of the theorem are particularly satisfied taking \((x_ i,\leq_ i)=({\mathbb{R}},\leq)\) for all i. (\(\leq\) the usual ordering on \({\mathbb{R}}.)\) In that case the theorem yields the following characterization of lexicographic orderings on \({\mathbb{R}}^ n \)as quasi- orderings \(\leq\) (reflexive, transitive, total binary relations) on \({\mathbb{R}}^ n \)having the following two properties: (i) \(\leq\) is stable, i.e. \(x\leq y\Leftrightarrow\tau\) \(x\leq \tau y\) for all x,y\(\in {\mathbb{R}}^ n,\) all scale transformations \(\tau\) defined by \(\tau z=(a_ 1z_ 1+b_ 1,...,a_ nz_ n+b_ n)\) with \(a_ i,b_ i\in {\mathbb{R}}\) and \(a_ i>0.\) (ii) \(\leq\) is strictly increasing, i.e. if \(x\neq y\) and \(x_ i\leq y_ i\) for \(i=1,...,n\), then \(x\leq y\) but not \(y\leq x\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references