Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information

DOI10.1287/moor.6.3.379zbMath0533.90100OpenAlexW2113618211MaRDI QIDQ3316995

S. Lakshmivarahan, Kumpati S. Narendra

Publication date: 1981

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.6.3.379

zbMATH Keywords

learning algorithmsMarkov processincomplete informationoptimal pure strategiestwo-person zero-sum sequential stochastic game

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15) Probabilistic games; gambling (91A60)

Related Items

Learning through reinforcement and replicator dynamics ⋮ Learning automata based multi‐agent system algorithms for finding optimal policies in Markov games ⋮ Learning models for decentralized decision making ⋮ Adaptive approaches to stochastic programming

This page was built for publication: Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information