Members of a shareholder meeting or legislative committee have greater or smaller voting power than meets the eye if the nucleolus of the induced majority game differs from the voting weight distribution. We establish a new sufficient condition for the weight and power distributions to be equal,...

Gvozdeva et al. (Int J Game Theory, doi:<ExternalRef> <RefSource>10.1007/s00182-011-0308-4</RefSource> <RefTarget Address="10.1007/s00182-011-0308-4" TargetType="DOI"/> </ExternalRef>, <CitationRef CitationID="CR17">2013</CitationRef>) have introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of (roughly) weighted voting games. Their third class <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$${\mathcal {C}}_\alpha $$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <msub> <mi mathvariant="script">C</mi> <mi mathvariant="italic">α</mi> </msub> </math> </EquationSource> </InlineEquation>...</equationsource></equationsource></inlineequation></citationref></refsource></externalref>

We state an integer linear programming formulation for the unique characterization of complete simple games, i.e. a special subclass of monotone Boolean functions. In order to apply the parametric Barvinok algorithm to obtain enumeration formulas for these discrete objects we provide a tailored...