Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
From MaRDI portal
Publication:6155058
DOI10.1007/s10589-023-00524-warXiv2107.01286OpenAlexW3181261771MaRDI QIDQ6155058
Dimitri J. Papageorgiou, Kevin C. Furman, Francisco Trespalacios, Stuart M. Harwood
Publication date: 16 February 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.01286
global optimizationNash equilibriumsemi-infinite programmingbilevel programmingunit commitmentspatial price equilibriumnonconvex games
Cites Work
- Unnamed Item
- Unnamed Item
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- Complementarity modeling in energy markets
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Solving discretely constrained, mixed linear complementarity problems with applications in energy
- Nash equilibria in the two-player kidney exchange game
- Global optimization of generalized semi-infinite programs using disjunctive programming
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
- Generalized semi-infinite programming: a tutorial
- Approximations of Nash equilibria
- Global solution of bilevel programs with a nonconvex inner program
- Infinitely constrained optimization problems
- A Shapley value representation of potential games
- A bridge between bilevel programs and Nash games
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- Alternative models for markets with nonconvexities
- A polyhedral branch-and-cut approach to global optimization
- Potential games
- On generalized semi-infinite optimization and bilevel optimization
- Global solution of nonlinear mixed-integer bilevel programs
- A note on solving discretely-constrained Nash-Cournot games via complementarity
- How to solve a semi-infinite optimization problem
- On the copositive representation of binary and continuous nonconvex quadratic programs
- An overview of bilevel optimization
- Note on noncooperative convex games
- Lower level duality and the global solution of generalized semi-infinite programs
- Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Nonconvex Games with Side Constraints
- An Algorithm for Solving the General Bilevel Programming Problem
- On relaxation algorithms in computation of noncooperative equilibria
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On differentiability properties of player convex generalized Nash equilibrium problems
- Equilibrium points in n -person games
- Generalized Nash equilibrium problems
- A branch-and-prune algorithm for discrete Nash equilibrium problems
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
This page was built for publication: Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
