Regular simple games (Q1123143)

The authors define two classes of simple games, the so-called regular and strongly regular games. The purpose of the paper is to characterize the class of (strongly) regular games within the simple games. The first main result states that a simple game is strongly regular if and only if the two sets of winning and losing coalitions respectively can be strictly separated by a finitely additive probability measure. The second and last main result states that a monotonic finite simple game is regular if and only if it is uniquely determined by its counting vector. The above mathematical notions should be interpreted as follows. Let I be a set and let C be an algebra of coalitions (subsets of I). A simple game on (I,C) is a function v: \(C\to \{0,1\}\) such that \(v(\emptyset)=0\) and \(v(I)=1\). The set W(v) of winning coalitions in the simple game v on (I,C) is given by \(W(v)=\{S\in C|\) \(v(S)=1\}\). The dual of the simple game v is given by the simple game \(v^*\) where \(v^*(S)=v(I)-v(I-S)\) for all \(S\in C\). For any finite sequence (or set) \(\sigma\) of coalitions in C, denote by \(| \sigma |\) the number of members in \(\sigma\) and denote by m(\(\sigma)\) the maximum number of members in \(\sigma\) with a nonempty intersection. For any simple game v, define the numbers i(v) and \(i^*(v)\) \(by\) i(v)\(=\inf \{| \sigma |^{-1}m(\sigma)|\) \(\sigma\) is a finite subset of W(v)\(\}\) \(and\) i\({}^*(v)=\inf \{| \sigma |^{-1}m(\sigma)|\) \(\sigma\) is a finite sequence of members in W(v)\(\}\). The number \(i^*(v)\) is known as the intersection number of the game v. For any simple game v on (I,C) and any \(z\not\in I\), denote by \(C_ 0\) the smallest algebra which contains \(C\cup \{\{z\}\}\) and let the constant sum extension of the simple game v be given by the simple game \(v_ 0\) on \((I\cup \{z\},C_ 0\}\) where \(v_ 0(S)=v(S)\) whenever \(z\not\in S\) and \(v_ 0(S)=v(I)-v(I-S)\) whenever \(z\in S\). The simple game v is called regular if \(\max [i(v_ 0),i(v^*_ 0)]>\) and v is called strongly regular if \(\max [i^*(v_ 0),i^*(v^*_ 0)]>\). Because \(i(v)\geq i^*\) for any simple game v, it is clear that a strongly regular game is also regular. According to the first main result, a simple game v on (I,C) is strongly regular iff there exists a finitely additive probability measure \(\mu\) on (I,C) such that sup\(\{\) \(\mu\) (S)\(|\) \(S\in C\), \(v(S)=0\}<\inf \{\mu (S)|\) \(S\in C\), \(v(S)=1\}\). According to the second main result, a monotonic finite simple game is regular iff it is uniquely determined by its so-called counting vector.