On the dimension of simple monotonic games

We show that the following problem is NP-hard, and hence computationally intractable: “Given d weighted majority games, decide whether the dimension of their intersection exactly equals d”. Our result indicates that the dimension of simple monotonic games is a combinatorially complicated concept.