Computing generalized Nash equilibria by polynomial programming
DOI10.1007/S00186-012-0422-5zbMATH Open1269.49062OpenAlexW2092747813MaRDI QIDQ2392820FDOQ2392820
Authors: Eleftherios Couzoudis, Philipp Renner 
Publication date: 2 August 2013
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://www.zora.uzh.ch/id/eprint/156520/1/ZORA_NL_156520.pdf
Recommendations
- Convex generalized Nash equilibrium problems and polynomial optimization
- Rational Generalized Nash Equilibrium Problems
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Generalized Nash equilibrium problems and Newton methods
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
nonconvex optimizationreal algebraic geometrytransmission lossgeneralized Nash equilibriumparametrized optimizationelectricity spot market
Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Sensitivity, stability, parametric optimization (90C31) (n)-person games, (n>2) (91A06) General equilibrium theory (91B50)
Cites Work
- Title not available (Why is that?)
- Global optimization of rational functions: a semidefinite programming approach
- Moments, positive polynomials and their applications
- GloptiPoly 3: moments, optimization and semidefinite programming
- Sums of squares, moment matrices and optimization over polynomials
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Generalized Nash equilibrium problems
- On gap functions for multivalued Stampacchia variational inequalities
- Gap functions for quasivariational inequalities and generalized Nash equilibrium problems
- Electricity spot market with transmission losses
- A ``joint+marginal approach to parametric polynomial optimization
Cited In (12)
- A competitive optimal stopping game
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
- Rational Generalized Nash Equilibrium Problems
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- LATIN 2004: Theoretical Informatics
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases
- Computing Nash equilibria by iterated polymatrix approximation
- On Structure and Computation of Generalized Nash Equilibria
- Convex generalized Nash equilibrium problems and polynomial optimization
- Computing all solutions of linear generalized Nash equilibrium problems
- Note on unique Nash equilibrium in continuous games
Uses Software
This page was built for publication: Computing generalized Nash equilibria by polynomial programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392820)
