Generalized Nash Equilibrium Problems
Abstract
We consider the generalized Nash equilibrium problem,
where the feasible sets of the players may depend on the other
players' strategies. This problem is emerging as an important
modelling tool but its use is limited by its great analytical
complexity. We consider several Newton methods, analyzing their
features and comparing their range of applicability. In
particular, we address the issue of the non local uniqueness of
the solutions that can cause severe difficulties in a
straightforward application of standard methods. We illustrate in
detail the results obtained by applying them to a model for
internet switching.
[DOI: 10.1685 / CSC06072] About DOI
where the feasible sets of the players may depend on the other
players' strategies. This problem is emerging as an important
modelling tool but its use is limited by its great analytical
complexity. We consider several Newton methods, analyzing their
features and comparing their range of applicability. In
particular, we address the issue of the non local uniqueness of
the solutions that can cause severe difficulties in a
straightforward application of standard methods. We illustrate in
detail the results obtained by applying them to a model for
internet switching.
[DOI: 10.1685 / CSC06072] About DOI
Full Text:
Except where otherwise noted, content on this site is licensed under a Creative Commons 2.5 Italy License