In this paper we give structural characterizations of disjunctive and conjunctive hierarchical simple games by characterizing them as complete games with a unique shift-maximal losing coalition, and a unique shift-minimal winning coalition, respectively. We prove canonical representation...

In this paper we prove that the plurality rule and the run-off procedure are asymptotically strategy-proof for any number of alternatives and that the proportion of profiles, at which a successful attempt to manipulate might take place, is in both cases bounded from above by <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$K/\sqrt n$$</EquationSource> </InlineEquation>,...</equationsource></inlineequation>