Homogeneous games (Q3255779)

An \(n\)-player game is called simple, if there exist winning coalitions, two disjoint sets are not both winning, and any set containing a winning coalition is also winning. Such a game is strong, if there are no ties between coalitions and it is homogeneous, if given any two players \(A\) and \(B\) it is possible to permute the players so as to take all winning sets into winning sets and \(A\) into \(B\). The following theorems are proved in this paper: \begin{itemize} \item[(1)] If \(n\) is a natural number, half of whose prime factors, or more, are odd, then there exists a strong simple homogeneous \(n\)-player game. If \(n\) is a power of 2, or if \(n = 12\), there is no such game. \item[(2)] If some winning set in a simple homogeneous \(n\)-player game contains only \(k\) players, then \(n\) cannot exceed \(k^2-1\). \item[(3)] There are exactly three strong simple homogeneous games which have the same number of minimal winning sets as of players, one each for \(n=1,3,7\). \end{itemize} It is not known whether, in (2), \(k^2-1\) could be replaced by \(k^2-k+1\).