Criterion for complete determinacy for concave-convexlike games (Q810385)

From MaRDI portal





scientific article; zbMATH DE number 4213769
Language Label Description Also known as
default for all languages
No label defined
    English
    Criterion for complete determinacy for concave-convexlike games
    scientific article; zbMATH DE number 4213769

      Statements

      Criterion for complete determinacy for concave-convexlike games (English)
      0 references
      1991
      0 references
      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.
      0 references
      minimax
      0 references
      Two-person zero-sum continuous games
      0 references
      concave-convex payoffs
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers