Approximations in Dynamic Zero-Sum Games II
From MaRDI portal
Recommendations
- Approximations in Dynamic Zero-Sum Games I
- Approximation Theorems for Zero-Sum Nonstationary Stochastic Games
- Approximation of two-person zero-sum continuous-time Markov games with average payoff criterion
- Approximation of zero-sum continuous-time Markov games under the discounted payoff criterion
- Approximate solutions of continuous-time stochastic games
Cited in
(11)- Dynamics of two-person zero-sum games with Boolean strategies and partially given payoff function
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- Approximating Nash equilibria in nonzero-sum games
- scientific article; zbMATH DE number 3878726 (Why is no real title available?)
- A Dijkstra-type algorithm for dynamic games
- Structure of approximate solutions of dynamic continuous time zero-sum games
- Approximations in Dynamic Zero-Sum Games I
- PARAMETER ANALYSIS OF A ZERO-SUM DIFFERENTIAL GAME APPROXIMATING A NONZERO-SUM GAME
- NUMERICAL METHODS FOR DIFFERENTIAL GAMES BASED ON PARTIAL DIFFERENTIAL EQUATIONS
- Robustness and sample complexity of model-based MARL for general-sum Markov games
- Approximating the value of zero-sum differential games with linear payoffs and dynamics
This page was built for publication: Approximations in Dynamic Zero-Sum Games II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377414)