Let G=(V,E) be a graph. Then S⊆V is an excess-t global powerful alliance if |N[v]∩S|≥|N[v]∩(V–S)|+t for every v∈V. If t=0, this definition reduces to that of a globalpowerfulalliance. Here we determine bounds on the cardinalities of such sets S.