Nonadditive set functions on a finite set and linear inequalities (Q1363591)

Set functions defined on the power set of a finite set \(\Omega\) are studied. Some families of set functions are considered as convex subsets of the linear space of all set functions \(f:\Omega\to\mathbb{R}\) such that \(f(\emptyset)= 0\), \(f(\Omega)= 1\). Besides probability measures the following classes of set functions are examined: belief and plausibility functions, submodular and supermodular functions and the upper and the lower envelopes of some classes of set functions. The author examines three problems: the domain extension theorem, the sandwich theorem and the realizability theorem for binary relations. In the published text of the extension theorem (Theorem 4.3) there is a misprint. A correct text (with regard to the proof) could be the following: \((G^*|M)^*= G|M\), whenever \(\{0,\Omega\}\subset M\subset 2^\Omega\) and \(G\) is considered belonging to a given class and lying between two given set functions. Finally, for given binary relation \(\preceq\) on \(2^\Omega\) some necessary and sufficient condition is given for the existence of a class \(G\) of set functions such that \(E\preceq F\) if and only if \(f(E)\leq f(F)\) for any \(f\in G\).