Intersection theorems and their applications in general almost convex spaces (Q414513)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Intersection theorems and their applications in general almost convex spaces
scientific article

    Statements

    Intersection theorems and their applications in general almost convex spaces (English)
    0 references
    0 references
    11 May 2012
    0 references
    The concept of almost convex set is extended in this paper as follows: If \(K\) and \(Y\) are two nonempty subsets of a topological vector space \(E\), \(Y\) is said to be relatively almost convex for \(K\) if for any neighborhood \(V\) of \(0\) in \(E\) and for any finite set \(\{w_1, \dots, w_n\} \subseteq K\), there exist \(z_1,\dots,z_n\in Y\) such that \(z_i - w_i \in V\) for all indices \(i\), and \(\text{co} \{z_1,\dots,z_n\} \subseteq Y\). The main result of the paper is the following intersection theorem: Let \(D\) be a dense subset of a compact set \(Z\) in a Hausdorff topological vector space and \(Y, K\) be two subsets of a locally convex Hausdorff topological vector space such that \(Y\) is relatively almost convex for \(K\). Suppose that \(H: Y\cup K \rightarrow 2^Z\) and \(T: Z\rightarrow 2^K\) are upper semicontinuous correspondences with closed values such that: (i) \(H(x)\) is nonempty convex for all \(x\in Y\); (ii) \(T(x)\) is nonempty convex for each \(x\in D\). Then the graphs of \(T^{-1}\) and \(H\) have a common point. By the above result are obtained two generalizations of the Himmelberg fixed point theorem, which in turn are used to obtain a maximal element theorem and equilibrium theorems for \(\mathcal{U}\)-majorized correspondences in generalized games.
    0 references
    0 references
    equilibrium
    0 references
    generalized game
    0 references
    qualitative game
    0 references
    general almost convex space
    0 references
    convex continuous correspondence
    0 references
    upper semicontinuous correspondence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references