Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications

DOI10.1080/07474946.2012.665685zbMath1251.91013OpenAlexW1967348104WikidataQ60327795 ScholiaQ60327795MaRDI QIDQ2888572

B. John Oommen, Asle Pedersen, Ole-Christoffer Granmo

Publication date: 1 June 2012

Published in: Sequential Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07474946.2012.665685

zbMATH Keywords

learning automatasensor networksGoore gamesintelligent game playingquality-of-service routing

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Rationality and learning in game theory (91A26) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
• Distributed scheduling using simple learning machines
• Learning automata and stochastic optimization
• Regret in the on-line decision problem
• Continuous action set learning automata for stochastic optimization
• On the linear model with two absorbing barriers
• Graph partitioning using learning automata
• A Note on the Learning Behavior of Variable-Structure Stochastic Automata
• The Nonstochastic Multiarmed Bandit Problem
• Use of Stochastic Automata for Parameter Self-Optimization with Multimodal Performance Criteria
• A general class of adaptive strategies

This page was built for publication: Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications