Distributed algorithms for the computation of noncooperative equilibria

Shu Li, Tamer Başar

Research output: Contribution to journalArticlepeer-review


In this paper, a general class of nonquadratic convex Nash games is studied, from the points of view of existence, stability and iterative computation of noncooperative equilibria. 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 is verified. 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 literature, and is furthermore more meaningful for real world implementation.

Original languageEnglish (US)
Pages (from-to)523-533
Number of pages11
Issue number4
StatePublished - Jul 1987


  • Game theory
  • distributed algorithms
  • inaccurate search techniques
  • noncooperative equilibria
  • numerical methods

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering


Dive into the research topics of 'Distributed algorithms for the computation of noncooperative equilibria'. Together they form a unique fingerprint.

Cite this