No label defined (Q4033225)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 165423
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 165423

      Statements

      0 references
      16 May 1993
      0 references
      Nash equilibria
      0 references
      gradient algorithms
      0 references
      The author considers an \(n\)-person non-coalitional game where every player \(i\) has the aim to minimize the gain function \(f_ i(x_ 1,\dots,x_{i-1},x_ i,x_{i+1},\dots,x_ n)\). The main emphasis in the theory of games is put on searching equilibria points, e.g. Nash equilibria points. The author investigates the following minmax problem: minimize the function \(P(x)=\max\bigl\{F(x, y): y\in X\bigr\},\) where \(F(x,y)=\sum^ n_{i=1}\bigl(f_ i(x)-f_ i(x_ 1,\dots,x_{i-1},y_ i,x_{i+1},\dots,x_ n)\bigr)\), \(x,y\in X= X_ 1\times X_ 2\times\cdots\times X_ n\), to decide the above-mentioned equilibrium problem. For its solution gradient algorithms are proposed and investigated.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references