Abstract
Some mapping is naturally associated with the noncooperative game of many persons. If this mapping is monotone, then the game is said to have a convex structure, and there are effective numerical methods for solving such games. how As a rule, finite coalition-free games in mixed strategies do not have convex structures. The article discusses modifications of such games based on perturbations the payoff functions of the players. Lower bounds for the magnitudes of perturbations are established, for which the modified game acquires a convex structure. Two new necessary and sufficient conditions for the presence of a convex structure in a finite coalition-free many-person game.
Comments
No posts found