We present a branch-and-prune procedure for discrete Nash equilibrium problems with a convex description of each player's strategy set. The derived pruning criterion does not require player convexity, but only strict convexity of some player's objective function in a single variable. If...

Purpose - The purpose of this paper is to study the Hölder calmness of solutions to equilibrium problems and apply it to economics. Design/methodology/approach - The authors obtain the Hölder calmness by using an effective approach. More precisely, under the key assumption of strong convexity,...