Pages that link to "Item:Q300326"
From MaRDI portal
The following pages link to Solving discretely-constrained Nash-Cournot games with an application to power markets (Q300326):
Displaying 18 items.
- Network expansion to mitigate market power (Q681461) (← links)
- Solving discretely constrained mixed complementarity problems using a median function (Q1642967) (← links)
- Efficiency and stability in electrical power transmission networks: a partition function form approach (Q1654573) (← links)
- Profit-maximization generation maintenance scheduling through bi-level programming (Q1681437) (← links)
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem (Q1754126) (← links)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
- Multimodal transportation flows in energy networks with an application to crude oil markets (Q2005845) (← links)
- A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games (Q2031943) (← links)
- A note on solving discretely-constrained Nash-Cournot games via complementarity (Q2129561) (← links)
- Computing equilibria for integer programming games (Q2160491) (← links)
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases (Q2178154) (← links)
- Optimal charging strategies under conflicting objectives for the protection of sensitive areas: a case study of the Trans-Pennine corridor (Q2357871) (← links)
- Competition and cooperation in a bidding model of electrical energy trade (Q2358048) (← links)
- Solving binary-constrained mixed complementarity problems using continuous reformulations (Q2668675) (← links)
- Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets (Q2828338) (← links)
- Γ-robust linear complementarity problems (Q5038437) (← links)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems (Q5060789) (← links)
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming (Q6155058) (← links)