Minimax inequalities on \(G\)-convex spaces with applications to generalized games (Q1590107): Difference between revisions

This article deals with \(G\)-convex (generally convex) spaces \((X,D,\Gamma)\). Here \(X\) is a topological space, \(D\) is an arbitrary non-empty set of \(X\), and \(\Gamma:\langle D\rangle\to 2^X\setminus\{\emptyset\}\) is a mapping defined on the family of non-empty finite subsets of \(D\) whose values are ``general'' simplexes in \(X\); it is assumed that \(\Gamma\) possesses some natural properties of monotonicity and regularity. The main results are \(G\)-analogues of Ky-Fan's minimax theorem, the corresponding fixed point theorem, the theorem on existence of maximal elements for majorized correspondences, and the existence theorems of equilibrium points and some others.