Distributed algorithms for the computation of noncooperative equilibria

For a general class of nonquadratlc convex noncooperative games, there exist distributed algomthms employing iteration m the policy space and accurate/inaccurate search techmques, which yield the umque stable Nash eqmhbrmm Key Words--Game theory, noncooperative eqmhbria, numencal methods, distributed algonthms, Inaccurate search techniques Al~traet--In this paper, a general class of nonquadratic convex Nash games is studied, from the points of view of existence, stabflay and iteratlve computation of noncooperative eqmhbrla Conditions for contraction of general nonlinear operators are obtained, which are then used in the stability study of such games These lead to existence and uniqueness conditions for stable Nash equilibrium solutions, under both global and local analysis Also, convergence of an algorithm which employs inaccurate search techniques ts venfied It Is shown in the context of a fish war example that the algorithm given is in some aspects superior to various algorithms found in the hterature, and is furthermore more meaningful for real world implementatmn