Average optimal strategies for zero-sum Markov games with poorly known payoff function on one side

DOI10.3934/jdg.2014.1.105zbMath1267.91014OpenAlexW2330617787MaRDI QIDQ351790

Fernando Luque-Vásquez, J. Adolfo Minjárez-Sosa

Publication date: 10 July 2013

Published in: Journal of Dynamics and Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jdg.2014.1.105

zbMATH Keywords

incomplete informationaverage payoff criterionpayoff estimationzero-sum Markov and semi-Markov games

Mathematics Subject Classification ID

Point estimation (62F10) Stochastic games, stochastic differential games (91A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-sum stochastic games with partial information
• Perfect information two-person zero-sum Markov games with imprecise transition probabilities
• Two person zero-sum semi-Markov games with unknown holding times distribution on one side: A discounted payoff criterion
• Markov games with incomplete information
• Zero-sum semi-Markov games in Borel spaces: Discounted and average payoff
• Zero-Sum Stochastic Games in Borel Spaces: Average Payoff Criteria
• Zero-Sum Ergodic Stochastic Games with Feller Transition Probabilities
• Asymptotically Optimal Strategies for Adaptive Zero-Sum Discounted Markov Games
• Note—A Note on Dynamic Programming with Unbounded Rewards
• Minimax Control of Discrete-Time Stochastic Systems
• Asymptotically Efficient Adaptive Strategies in Repeated Games Part I: Certainty Equivalence Strategies
• Asymptotically Efficient Adaptive Strategies in Repeated Games Part II. Asymptotic Optimality
• On Markov Games with Average Reward Criterion and Weakly Continuous Transition Probabilities
• Adaptive policy for two finite Markov chains zero-sum stochastic game with unknown transition matrices and average payoffs

This page was built for publication: Average optimal strategies for zero-sum Markov games with poorly known payoff function on one side