We establish that the robust von Neumann minimax theorem is guaranteed for various classes of bounded uncertainties, including the matrix 1-norm uncertainty, ...
Abstract. The celebrated von Neumann minimax theorem is a fundamental theorem in two-person zero-sum games. In this paper, we present a generalization of ...
We establish that the robust von Neumann minimax theorem is guaranteed for various classes of bounded uncertainties, including the matrix 1-norm uncertainty, ...
Vaithilingam Jeyakumar , Guoyin Li , Gue Myung Lee: A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. Oper. Res.
The class of problems includes programs with SOS-convex polynomials under data uncertainty in the objective function such as uncertain quadratically constrained ...
We establish that the robust von Neumann minimax theorem is guaranteed for various classes of bounded uncertainties, including the matrix 1‐norm uncertainty, ...
Apr 15, 2024 · I am confused about how these equilibriums relate to each players max-min and min-max strategy and Von Neumann's Minimax theorem. And the ...
People also ask
What is the minimax theorem von Neumann?
What is the minimax in zero-sum game?
What is the minimax theorem game theory proof?
What is strong minimax theorem?
... robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty Operations Research Letters 39(2): 109-114 · Kurano, M.; Yasuda, M ...
A robust von Neumann minimax theorem for zero‐sum games under ...
Per- haps the most central result in game theory, the minimax theorem (von Neumann 1928), has established that zero-sum games admit natural “optimal” strategies ...
Missing: robust | Show results with:robust