
doi: 10.1007/bf01158303
Two-person zero-sum continuous games with concave-convex payoffs are considered. A necessary and sufficient condition for the existence of a solution to the game is proved. As a sufficient condition this generalizes a well-known theorem of von Neumann, but as a necessary condition it is new. Here the convexity notion is extended by the assumption of the existency only of a point \(x_{\alpha}\) instead of the traditional \(x_{\alpha}=\alpha x^ 1+(1-\alpha)x^ 2\). The proved criterion is the formulation of the upper semicontinuity of a special functional in the point zero.
minimax, Two-person zero-sum continuous games, concave-convex payoffs, 2-person games
minimax, Two-person zero-sum continuous games, concave-convex payoffs, 2-person games
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
