Methods for solving generalized Nash equilibrium (Q2375662): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/762165 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2040288883 / rank | |||
Normal rank |
Revision as of 22:47, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Methods for solving generalized Nash equilibrium |
scientific article |
Statements
Methods for solving generalized Nash equilibrium (English)
0 references
14 June 2013
0 references
Summary: The generalized Nash equilibrium problem (GNEP) is an extension of the standard Nash equilibrium problem (NEP), in which each player's strategy set may depend on the rival player's strategies. In this paper, we present two descent type methods. The algorithms are based on a reformulation of the generalized Nash equilibrium using Nikaido-Isoda function as unconstrained optimization. We prove that our algorithms are globally convergent and the convergence analysis is not based on conditions guaranteeing that every stationary point of the optimization problem is a solution of the GNEP.
0 references