Non-cooperative games with minmax objectives (Q742296)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Non-cooperative games with minmax objectives |
scientific article |
Statements
Non-cooperative games with minmax objectives (English)
0 references
18 September 2014
0 references
The authors consider noncooperative games where each player's penalty function is composite, with the second term being a common nonsmooth function, which is supposed to be given by a max-type one. They propose two ways to treat this problem. Firstly, they replace it with the enlarged one, where the common term is transferred to an additional player with the corresponding smooth payoff function, thus removing the maximum operation. Secondly, they suggest a smoothing approximation of the common term, which gives a parametric family of Nash equilibrium problems. Convergence results for the general best response algorithm are given. Its diagonalized versions are also discussed.
0 references
noncooperative games
0 references
Nash equilibrium
0 references
composite penalty
0 references
smooth approximation
0 references
best response
0 references
diagonalization
0 references
0 references
0 references
0 references
0 references