Permutation invariance

From MaRDI portal
Publication:2496152





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.











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)