An ε-Minimax Theorem for Bi-Lower-Semicontinuous Set-Valued Mappings
Caiyun Jin
Abstract
Caiyun Jin
Abstract
In this article, an approximate minimax theorem for bi-lower-semicontinuous set-valued mapping was proved, relationships between semicontinuous set-valued mappings are discussed and the existence of approximate maxmin was given. The minimax theorem in this article is the first minimax theorem that doesn’t require the set-valued mappings to be continuous.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this article, an approximate minimax theorem for bi-lower-semicontinuous set-valued mapping was proved, relationships between semicontinuous set-valued mappings are discussed and the existence of approximate maxmin was given. The minimax theorem in this article is the first minimax theorem that doesn’t require the set-valued mappings to be continuous.
Key concepts: Minimax, Mathematics, Minimax theorem, Set (abstract data type), Discrete mathematics, Danskin's theorem, Minimax approximation algorithm, Combinatorics