Absolutely expedient algorithms for learning Nash equilibria
From MaRDI portal
Publication:1322380
DOI10.1007/BF02830892zbMath0811.90130OpenAlexW2011987346MaRDI QIDQ1322380
V. V. Phansalkar, P. S. Sastry, M. A. L. Thathachar
Publication date: 1994
Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02830892
Learning and adaptive systems in artificial intelligence (68T05) (n)-person games, (n>2) (91A06) Stochastic learning and adaptive control (93E35) Stochastic games, stochastic differential games (91A15)
Related Items (3)
Learning through reinforcement and replicator dynamics ⋮ Learning automata in feedforward connectionist systems ⋮ Transient and asymptotic dynamics of reinforcement learning in games
Cites Work
- A cooperative game of a pair of learning automata
- Absolute expediency of learning automata
- Dynamic noncooperative game theory
- epsilon-optimality of a general class of learning algorithms
- A Learning Model for Routing in Telephone Networks
- Decentralized learning in finite Markov chains
- Relaxation Labeling with Learning Automata
- Learning Optimal Discriminant Functions through a Cooperative Game of Automata
- Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information: A Unified Approach
- Decentralized learning of Nash equilibria in multi-person stochastic games with incomplete information
- Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
- Absolutely Expedient Learning Algorithms for Stochastic Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Absolutely expedient algorithms for learning Nash equilibria
