Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information: A Unified Approach

DOI10.1137/0320039zbMath0489.93049OpenAlexW2090697311MaRDI QIDQ3951987

Kumpati S. Narendra, S. Lakshmivarahan

Publication date: 1982

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0320039

zbMATH Keywords

learning algorithmincomplete informationtwo-person zero-sum stochastic games

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) 2-person games (91A05) Optimal stochastic control (93E20) Probabilistic games; gambling (91A60)

Related Items (7)

Bush‐Mosteller learning for a zero-sum repeated game with random pay-offs ⋮ Learning through reinforcement and replicator dynamics ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS ⋮ Learning models for decentralized decision making ⋮ Adaptive approaches to stochastic programming ⋮ Absolutely expedient algorithms for learning Nash equilibria

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