On linear programming duality and necessary and sufficient conditions in minimax theory
From MaRDI portal
Publication:946325
DOI10.1007/s10957-007-9164-6zbMath1146.49022OpenAlexW2026551772MaRDI QIDQ946325
J. B. G. Frenk, Peter Kas, Gábor Kassay
Publication date: 23 September 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9164-6
Noncooperative games (91A10) Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) 2-person games (91A05) Duality theory (optimization) (49N15) Optimality conditions for minimax problems (49K35)
Related Items (5)
On equivalent results in minimax theory ⋮ New differential properties of sup-type functions ⋮ On linear programming duality and necessary and sufficient conditions in minimax theory ⋮ A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty ⋮ The level set method of Joó and its use in minimax theory
Cites Work
- On some convexities
- On linear programming duality and necessary and sufficient conditions in minimax theory
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- On equivalent results in minimax theory
- On a generalized sup-inf problem
- The level set method of Joó and its use in minimax theory
- Generalization of a theorem by v. Neumann concerning zero sum two person games
- On Borel probability measures and noncooperative game theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On linear programming duality and necessary and sufficient conditions in minimax theory
