Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures (Q1184360)

The authors consider in general a family of \(k\)-ary relations \(R\) on a finite set \(A\), and a probability distribution on the power set of \(R\). Then one has a probabilistic relation defined on \(a_ 1,\dots,a_ k\) as the probability measure of the set of relations to which this \(k\)-tuple belongs. The authors prove that there exist finite and computable linear equations and inequalities characterizing these probabilistic structures.