Permutation invariance
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.
- Removal independent consensus methods for closed \(\beta \)-systems of sets
- Permutation invariant norms
- An introduction to Allan Gibbard's oligarchy theorem paper
- Generalized Edwards transformation and principle of permutation invariance
- Hierarchies and ternary separation
- Injectivity and weak ternary separation
- scientific article; zbMATH DE number 524370 (Why is no real title available?)
- scientific article; zbMATH DE number 1974590 (Why is no real title available?)
This page was built for publication: Permutation invariance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496152)