Pages that link to "Item:Q1396833"
From MaRDI portal
The following pages link to A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information (Q1396833):
Displaying 13 items.
- A Dijkstra-type algorithm for dynamic games (Q338209) (← links)
- Solving subclasses of multi-player stochastic games via linear complementarity problem formulations -- a survey and some new results (Q400030) (← links)
- Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information (Q433846) (← links)
- Policy improvement for perfect information additive reward and additive transition stochastic games with discounted and average payoffs (Q482541) (← links)
- Perfect information two-person zero-sum Markov games with imprecise transition probabilities (Q857945) (← links)
- Optimizing over pure stationary equilibria in consensus stopping games (Q2281451) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- Orderfield property of mixtures of stochastic games (Q2431021) (← links)
- A policy iteration algorithm for zero-sum stochastic games with mean payoff (Q2504730) (← links)
- Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information (Q3316995) (← links)
- A policy iteration algorithm for nonzero-sum stochastic impulse games (Q4967861) (← links)
- A Policy Improvement Algorithm for Solving a Mixture Class of Perfect Information and AR-AT Semi-Markov Games (Q5149581) (← links)
- Stochastic Games (Q5149735) (← links)
