On the linear model with two absorbing barriers

DOI10.1016/0022-2496(68)90073-4zbMath0157.26601OpenAlexW2019904074MaRDI QIDQ2527418

M. Frank Norman

Publication date: 1968

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-2496(68)90073-4

zbMATH Keywords

mathematical biology

Related Items (16)

Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications ⋮ When can the two-armed bandit algorithm be trusted? ⋮ Distributed dynamic reinforcement of efficient outcomes in multiagent coordination and network formation ⋮ Regret bounds for Narendra-Shapiro bandit algorithms ⋮ Learning automaton as a model to simulate and analyse learning behaviour in rats ⋮ How Fast Is the Bandit? ⋮ On ergodic two-armed bandits ⋮ On a general class of absorbing-barrier learning algorithms ⋮ Learning behaviours of hierarchical structure stochastic automata operating in a non-stationary multi-teacher environment ⋮ Convergence in models with bounded expected relative hazard rates ⋮ Nonconvergence to saddle boundary points under perturbed reinforcement learning ⋮ Learning behavior of stochastic automata in the last stage of learning ⋮ Theoretical considerations of the parameter self-optimization by stochastic automata ⋮ An application of the stochastic automaton to the investment game ⋮ Slow learning with small drift in two-absorbing-barrier models ⋮ epsilon-optimality of a general class of learning algorithms

Cites Work

• Some convergence theorems for stochastic learning models with distance diminishing operators
• Some random walks arising in learning models. I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the linear model with two absorbing barriers