Sampling average approximation method for a class of stochastic Nash equilibrium problems
DOI10.1080/10556788.2012.750321zbMath1278.65069OpenAlexW2033326211MaRDI QIDQ2867407
Pei-Yu Li, Zhifeng He, Gui-Hua Lin
Publication date: 19 December 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.750321
Numerical optimization and variational techniques (65K10) Numerical computation of solutions to systems of equations (65H10) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
Cites Work
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
- Restricted generalized Nash equilibria and controlled penalty algorithm
- Generalized Nash equilibrium problems and Newton methods
- Generalized Nash games and quasi-variational inequalities
- A semi-smooth Newton method for elasto-plastic contact problems
- A nonsmooth version of Newton's method
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- On generalized Nash games and variational inequalities
- A Stochastic Multiple-Leader Stackelberg Model: Analysis, Computation, and Application
- Optimization and nonsmooth analysis
- Optimization with Stochastic Dominance Constraints
- Monte Carlo sampling approach to stochastic programming
- Spatial Oligopolistic Electricity Models with Cournot Generators and Regulated Transmission Prices
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
This page was built for publication: Sampling average approximation method for a class of stochastic Nash equilibrium problems