We consider a finite game of several players in a normal form with perturbed linear payoffs where perturbations formed by a set of additive matrices, with two arbitrary Hölder norms specified independently in the outcome and criterion spaces. The concept of equilibrium is generalized using the coalitional profile, i.e. by partitioning the players of the game into coalitions. In this situation, two extreme cases of this partitioning correspond to the Pareto optimal outcome and the Nash equilibrium outcome, respectively. We analyze such type of stability, called strong stability, that is under any small admissible perturbations the efficiency of at least one optimal outcome of the game is preserved. The attainable upper and lower bounds of such perturbations are specified. The obtained result generalizes some previously known facts and sheds more light on the combinatorial specific of the problem considered. Some numerical examples illustrating the main result are specified.