Representations of simple games by social choice functions

We investigate possible constructions of choice procedures (social choice functions) for committees (simple games). The notion of a capacity of a committee is derived from our construction. We determine the capacity of strong, symmetric and weak simple games. We also provide an upper bound on the capacity of a simple game without veto players.