Finding multiple Nash equilibria via machine learning-supported Gröbner bases
DOI10.1016/J.EJOR.2020.01.041zbMATH Open1441.91001OpenAlexW3003930742MaRDI QIDQ2178154FDOQ2178154
Authors: Markus Löschenbrand 
Publication date: 7 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.01.041
Recommendations
- scientific article; zbMATH DE number 4068657
- On learning algorithms for Nash equilibria
- scientific article; zbMATH DE number 165423
- Nash equilibrium seeking in \(N\)-coalition games via a gradient-free method
- On Structure and Computation of Generalized Nash Equilibria
- Absolutely expedient algorithms for learning Nash equilibria
- scientific article; zbMATH DE number 2151184
- Computing generalized Nash equilibria by polynomial programming
- Computing Nash equilibria by iterated polymatrix approximation
Symbolic computation and algebraic computation (68W30) Nonlinear programming (90C30) Economic models of real-world systems (e.g., electricity markets, etc.) (91B74) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- A Mixed Complementarity Model of Hydrothermal Electricity Competition in the Western United States
- Title not available (Why is that?)
- Note on noncooperative convex games
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Dynamic programming and optimal control. Vol. 2
- Computing approximate Nash equilibria in general network revenue management games
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- Complementarity modeling in energy markets
- An algebraic approach to integer portfolio problems
- Finding all Nash equilibria of a finite game using polynomial algebra
- Computing global minima to polynomial optimization problems using Gröbner bases
- Tackling multiplicity of equilibria with Gröbner bases
- Some complexity results for polynomial ideals
- On the complexity of the \(F_5\) Gröbner basis algorithm
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- Stochastic short-term hydropower planning with inflow scenario trees
- Impact of storage competition on energy markets
- Generation flexibility in ramp rates: strategic behavior and lessons for electricity market design
- Dynamic programming and optimal control. Vol. 1.
Uses Software
This page was built for publication: Finding multiple Nash equilibria via machine learning-supported Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178154)
