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...

After an introduction to main ideas of semi-infinite optimization, this article surveys recent developments in theory and numerical methods for standard and generalized semi-infinite optimization problems. Particular attention is paid to connections with mathematical programs with...

Many economic models and optimization problems generate (endogenous) shadow prices - alias dual variables or Lagrange multipliers. Frequently the “slopes” of resulting price curves - that is, multiplier derivatives - are of great interest. These objects relate to the Jacobian of the...