Recursive algorithms, urn processes and chaining number of chain recurrent sets
From MaRDI portal
Publication:4236254
DOI10.1017/S0143385798097557zbMath0921.60061OpenAlexW1995215302MaRDI QIDQ4236254
Publication date: 29 September 1999
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0143385798097557
Discrete-time Markov processes on general state spaces (60J05) Attractors and repellers of smooth dynamical systems and their topological structure (37C70)
Related Items
Sur quelques algorithmes récursifs pour les probabilités numériques, Naive Learning Through Probability Overmatching, Evolution in games with randomly disturbed payoffs, Sampling best response dynamics and deterministic equilibrium selection, On limiting behavior of stationary measures for stochastic evolution systems with small noise intensity, On limit measures and their supports for stochastic ordinary differential equations, First-order methods for convex optimization, Stochastic imitative game dynamics with committed agents, Dynamic nonlinear pricing model based on adaptive and sophisticated learning, Random switching between vector fields having a common zero, Evolutionary Game Theory, Network formation by reinforcement learning: the long and medium run, A computational approach to steady-state convergence of fluid limits for Coxian queuing networks with abandonment, Nonlinear randomized urn models: a stochastic approximation viewpoint, Stochastic approximation algorithms: overview and recent trends., Sample Path Large Deviations for Stochastic Evolutionary Game Dynamics, Deterministic approximation of best-response dynamics for the matching pennies game, Fluid computation of passage-time distributions in large Markov models, Stochastic approximation algorithms with constant step size whose average is cooperative, Pairwise comparison dynamics and evolutionary foundations for Nash equilibrium, Model checking single agent behaviours by fluid approximation, Convergence of Recursive Stochastic Algorithms Using Wasserstein Divergence, Large deviations and stochastic stability in population games
