In this chapter we give an overview on the theory of noncooperative games. In the first part we consider in detail for zero-sum (and constant-sum) noncooperative games under which necessary and sufficient conditions on the payoff function and different (extended) strategy sets for both players...

We consider equilibrium constrained optimization problems, which have a general formulationthat encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated K K M lemma, we...

We consider equilibrium constrained optimization problems, which have a general formulationthat encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated K K M lemma, we...

This paper studies algorithms for equilibrium problems with equilibrium constraints (EPECs). We present a generalization of Scholtes’s regularization scheme for MPECs and extend his convergence results to this new relaxation method. We propose a sequential nonlinear complementarity (SNCP)...

In this chapter we give an overview on the theory of noncooperative games. In the first part we consider in detail for zero-sum (and constant-sum) noncooperative games under which necessary and sufficient conditions on the payoff function and different (extended) strategy sets for both players...

We consider equilibrium constrained optimization problems, which have a general formulationthat encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated K K M lemma, we...

A bundle method for minimizing the difference of convex (DC) and possibly nonsmooth functions is developed. The method may be viewed as an inexact version of the DC algorithm, where each subproblem is solved only approximately by a bundle method. We always terminate the bundle method after the...

Lipschitz continuity of the gradient mapping of a continuously differentiable function plays a crucial role in designing various optimization algorithms. However, many functions arising in practical applications such as low rank matrix factorization or deep neural network problems do not have a...

In the paper, we re-investigate the long run behavior of an adaptive learning process driven by the stochastic replicator dynamics developed by Fudenberg and Harris (1992). It is demonstrated that the Nash equilibrium will be the robust limit of the adaptive learning process as long as it is...

This paper measures the evolution of the interdependence level of the global economic system using a novel approach that combines network analysis and time-varying correlations. A Scalar-BEKK model is employed to determine the dynamic conditional bilateral correlations of 102 economies for the...