Coincidence theorems with applications to minimax inequalities, section theorem, best approximation and multiobjective games in topological spaces (Q882752)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Coincidence theorems with applications to minimax inequalities, section theorem, best approximation and multiobjective games in topological spaces
scientific article

    Statements

    Coincidence theorems with applications to minimax inequalities, section theorem, best approximation and multiobjective games in topological spaces (English)
    0 references
    0 references
    0 references
    24 May 2007
    0 references
    The authors prove some coincidence theorems (\(\exists x_0 : F(x_0)\cap G^{-1}(x_0)\neq\emptyset\)) for an axiomatically defined class of \(\mathfrak{A}_c^k\) maps called `admissible' (\(F\in \mathfrak{A}_c^k\)) and for maps with transfer compactly open-valued inverse \(G^{-1}\). The class \(\mathfrak{A}_c^k\) contains many well-known classes of multivalued maps. The results are proven in general topological spaces but some kind of a fixed point property is hidden in a definition of the class \(\mathfrak{A}_c^k\), i.e., for any polytope \(P\), each \(F\in \mathfrak{A}_c^k(P,P)\) has a fixed point. In the proofs, a suitable polytope is chosen by the use of a generalized relative KKM property strictly connected with the map \(G\). The abstract results are applied to formulate sufficient conditions for the existence of weighted Nash equilibria and Pareto equilibria in multiobjective games. In this part of the paper some formulations are misleading. For instance, strategies are elements of a finite dimensional space, not of a general topological space in contrast to the authors' formulations of the results.
    0 references
    set-valued mappings
    0 references
    generalized \(R\)-KKM mappings
    0 references
    transfer compactly open-valued
    0 references
    multiobjective games
    0 references

    Identifiers

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