Perfect information two-person zero-sum Markov games with imprecise transition probabilities
From MaRDI portal
Publication:857945
DOI10.1007/S00186-006-0081-5zbMATH Open1124.91008OpenAlexW1995009380MaRDI QIDQ857945FDOQ857945
Authors: Hyeong Soo Chang 
Publication date: 5 January 2007
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-006-0081-5
Recommendations
- Perfect information stochastic games and related classes
- Perfect-information stochastic mean-payoff parity games
- Foundations of Software Science and Computation Structures
- Perfect-information stochastic games with generalized mean-payoff objectives
- Zero-sum stochastic games with partial information
- Perfect-information games with lower-semicontinuous payoffs
- Perfect information games with upper semicontinuous payoffs
- A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
Cites Work
- The complexity of stochastic games
- Title not available (Why is that?)
- Stochastic Games
- Title not available (Why is that?)
- Markov set-chains
- A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
- Bounded-parameter Markov decision processes
- Markov Decision Processes with Imprecise Transition Probabilities
- Markovian Decision Processes with Uncertain Transition Probabilities
- Two-person zero-sum markov games: receding horizon approach
- An on-line procedure in discounted infinite-horizon stochastic optimal control
- Infinite horizon nonstationary stochastic optimal control problem: A planning horizon result
- Controlled Markov set-chains with discounting
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Perfect information two-person zero-sum Markov games with imprecise transition probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857945)
