Algorithms for some infinite-state MDPs and stochastic games (invited talk)

Mathematics

• Stochastic Game 100%
• Newton's Method 100%
• Probability Theory 50%
• Optimality 50%
• Fixed Points 50%
• Open Question 50%
• Polynomial Equation 50%
• Death Process 50%
• State Markov Chain 50%
• Stochastic Process 50%
• Bellman Equation 50%
• Greatest Fixed Point 50%
• Polynomial Time 50%
• State Model 50%
• Linear Programming 50%
• Branching Process 50%
• Min-Max 50%
• Past Decade 50%

Computer Science

• Automaton 100%
• Fixed Points 100%
• Newton's Method 100%
• Theoretic Model 50%
• Computational Complexity 50%
• Model Checking 50%
• Polynomial Time Algorithm 50%
• Context-Free Grammars 50%
• Reachability Probability 50%
• Pushdown Automaton 50%
• Procedural Program 50%
• Markov Chain 50%
• Linear Programming 50%
• Polynomial Equation 50%