Permutation invariance (Q2496152)

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 5040222
Language Label Description Also known as
default for all languages
No label defined
    English
    Permutation invariance
    scientific article; zbMATH DE number 5040222

      Statements

      Permutation invariance (English)
      0 references
      0 references
      0 references
      12 July 2006
      0 references
      The concepts of a \(\beta \)-closed system \(H\) of subsets on \(E\), of a consensus function \(C\) on \(W\) and of a profile \(P\) of \(H\) are introduced in the paper. Let \(W\) be a collection of \(\beta \)-closed systems on \(E\) with a consensus function \(C\). Then \(C\) is permutation invariant if for any permutation \(\sigma \) of \(E\) and any profile \(P\), \(P=\sigma P\) implies \(C(P)=\sigma C(P)\). The concept of permutation invariance describes properties of clusters. Versions of Arrow's seminal theorem on weak orders have been established in many different contexts. A general model is presented here, in which many of these results are embedded. The model includes versions of independence of irrelevant alternatives and notions relating to invariance under action of certain permutations of the underlying set.
      0 references
      0 references
      set systems
      0 references
      Arrow's theorem
      0 references
      consensus
      0 references

      Identifiers