On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method

From MaRDI portal
Publication:2434993


DOI10.1007/s10107-012-0558-3zbMath1282.90201MaRDI QIDQ2434993

Uday V. Shanbhag, Jong-Shi Pang, Dane A. Schiro

Publication date: 3 February 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0558-3


90C90: Applications of mathematical programming

91A10: Noncooperative games

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

91A40: Other game-theoretic models


Related Items

On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables, Exact Penalization of Generalized Nash Equilibrium Problems, A best-response approach for equilibrium selection in two-player generalized Nash equilibrium problems, Unnamed Item, Rational Generalized Nash Equilibrium Problems, Coordination of power and natural gas markets via financial instruments, The cone condition and nonsmoothness in linear generalized Nash games, Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints, Some LCPs solvable in strongly polynomial time with Lemke's algorithm, Differential variational inequality approach to dynamic games with shared constraints, Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets, A new error bound result for generalized Nash equilibrium problems and its algorithmic application, Two-stage non-cooperative games with risk-averse players, Computing solutions of the multiclass network equilibrium problem with affine cost functions, Computing all solutions of linear generalized Nash equilibrium problems, Open-loop and feedback Nash equilibria in constrained linear-quadratic dynamic games played over event trees, Solving equilibrium problems using extended mathematical programming, Improved error bound and a hybrid method for generalized Nash equilibrium problems, Perfectly competitive capacity expansion games with risk-averse participants, Local search in quadratic two-person game, Convex generalized Nash equilibrium problems and polynomial optimization


Uses Software


Cites Work