FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
S. D. FLÃ…M
This paper considers a fairly large class of noncooperative games in which strategies are jointly constrained. When what is called the Ky Fan or NikaidÃ´-Isoda function is convex-concave, selected Nash equilibria correspond to diagonal saddle points of that function. This feature is exploited to design computational algorithms for finding such equilibria.To comply with some freedom of individual choice the algorithms developed here are fairly decentralized. However, since coupling constraints must be enforced, repeated coordination is needed while underway towards equilibrium.Particular instances include zero-sum, two-person games â or minimax problems â that are convex-concave and involve convex coupling constraints.
Noncooperative games, Nash equilibrium, joint constraints, quasi-variational inequalities, exact penalty, subgradient projection, proximal point algorithm, partial regularization, saddle points, Ky Fan or NikaidÃ´-Isoda functions, 90C25, 91A10
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.