A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
From MaRDI portal
Publication:2275574
Recommendations
- On existence theorem for equilibrium of robust game with uncertain nonlinear payoff functions
- Minimax theorem on a two-person zero-sum dynamic game
- A minmax theorem for concave-convex mappings with no regularity assumptions
- scientific article; zbMATH DE number 36672
- A theorem of the maximin and applications to Bayesian zero-sum games
Cites work
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Constructing uncertainty sets for robust linear optimization
- Duality in robust optimization: Primal worst equals dual best
- Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
- scientific article; zbMATH DE number 3358265 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Minimax Theorems
- Minimax theorems for set-valued mappings.
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On Extension of Fenchel Duality and its Application
- On linear programming duality and necessary and sufficient conditions in minimax theory
- On noncooperative games, minimax theorems, and equilibrium problems
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust Farkas' lemma for uncertain linear systems with applications
- Robust game theory
- Robust linear optimization under general norms.
- Robust optimization
- Robust optimization-methodology and applications
- Strong duality in robust convex programming: complete characterizations
Cited in
(18)- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Global optimality condition for quadratic optimization problems under data uncertainty
- Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function
- An efficient algorithm for the extended trust-region subproblem with two linear constraints
- A robust optimization approach for solving two-person games under interval uncertainty
- Strong duality for robust minimax fractional programming problems
- Robust nonlinear optimization with conic representable uncertainty set
- Robust solutions to multi-objective linear programs with uncertain data
- Robust linear semi-infinite programming duality under uncertainty
- Minimax theorems for scalar set-valued mappings with nonconvex domains and applications
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- Support vector machine classifiers with uncertain knowledge sets via robust optimization
- Robust duality for generalized convex programming problems under data uncertainty
- Robust duality for fractional programming problems with constraint-wise data uncertainty
This page was built for publication: A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275574)
