Establishes almost-equivalence between minimax for bilinear zero-sum games on cone bases and strong duality for conic programs, extending LP-game results to Banach spaces with a game-dependent characterization of strict feasibility.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Equivalence of Zero-Sum Games and Conic Programs
Establishes almost-equivalence between minimax for bilinear zero-sum games on cone bases and strong duality for conic programs, extending LP-game results to Banach spaces with a game-dependent characterization of strict feasibility.