Restricted generalized Nash equilibria and controlled penalty algorithm

Restricted generalized Nash equilibria and controlled penalty algorithm

0.00 Avg rating0 Votes
Article ID: iaor20116862
Volume: 8
Issue: 3
Start Page Number: 201
End Page Number: 218
Publication Date: Aug 2011
Journal: Computational Management Science
Authors:
Keywords: Nash equilibrium
Abstract:

The generalized Nash equilibrium problem (GNEP) is a generalization of the standard Nash equilibrium problem, in which each player’s strategy set may depend on the rival players’ strategies. The GNEP has recently drawn much attention because of its capability of modeling a number of interesting conflict situations in, for example, an electricity market and an international pollution control. However, a GNEP usually has multiple or even infinitely many solutions, and it is not a trivial matter to choose a meaningful solution from those equilibria. The purpose of this paper is two‐fold. First we present an incremental penalty method for the broad class of GNEPs and show that it can find a GNE under suitable conditions. Next, we formally define the restricted GNE for the GNEPs with shared constraints and propose a controlled penalty method, which includes the incremental penalty method as a subprocedure, to compute a restricted GNE. Numerical examples are provided to illustrate the proposed approach.

Reviews

Required fields are marked *. Your email address will not be published.