An algorithm for solving subproblems of Nash equilibrium

MaRDI QIDQ2746289zbMATH OpenFDO

Authors Zixiang Ouyang

Publication date 2 June 2002

Published in Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

iterative algorithmconvergencenumerical examplesNash equilibriumconvex quadratic programnonlinear program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)

Recommendations

• Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
• Equilibrium programming using proximal-like algorithms
• scientific article; zbMATH DE number 3956853
• Numerical solution of an equilibrium problem of based on the generalized level method
• A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models

Cited in

(7)

• scientific article; zbMATH DE number 5722763 (Why is no real title available?)
• scientific article; zbMATH DE number 5283827 (Why is no real title available?)
• A note on Khilnani and Tse's USA algorithm
• scientific article; zbMATH DE number 4068657 (Why is no real title available?)
• A splitting subgradient algorithm for solving equilibrium problems involving the sum of two bifunctions and application to cournot-nash model
• A branch-and-bound algorithm for nonconvex Nash equilibrium problems
• A trust region algorithm for Nash equilibrium problems

This page was built for publication: An algorithm for solving subproblems of Nash equilibrium

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746289)