Abstract
We consider a two$person game and an associated mapping which in its turn generates a variational inequality problem. The problem of finding the Nash points of the game is reduced to the solution of the above-mentioned inequality. However the mapping thus related to a non-antagonistic game need not be monotone, where as the standard numerical methods to solve variational inequality problems work well when the mapping in question is monotone. In our research we have revealed a series of classes of non-antagonistic two-person games which associated mappings generating the corresponding variational inequality problem, are monotone.
Comments
No posts found