Completeness is a necessary condition for a simple game to be representable as a weighted voting system. This paper deals with the class of complete simple games and centers on their structure. Using an extension of Isbell's desirability relation to coalitions, different from the extension normally used, we associate with any complete simple game a lattice of coalition models based upon the types of indifferent players. We establish the basic properties of a vector with natural components and a matrix with non-negative integer entries, both closely related to the lattice, which are also shown to be characteristic invariants of the game, in the sense that they determine it uniquely up to isomorphisms.