Replicator dynamics: old and new
From MaRDI portal
Publication:828036
DOI10.3934/jdg.2020028zbMath1455.91046OpenAlexW3082432392MaRDI QIDQ828036
Publication date: 14 January 2021
Published in: Journal of Dynamics and Games (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jdg.2020028
replicator dynamicsno regretbest reply dynamicsdiscrete and continuous timemultiplicative weight algorithmpotential and dissipative games
Related Items
No-regret algorithms in on-line learning, games and convex optimization, Continuous time learning algorithms in optimization and game theory, Firms, technology, training and government fiscal policies: an evolutionary approach, Learning in nonatomic games. I: Finite action spaces and population games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Finite composite games: equilibria and dynamics
- Imitative dynamics for games with continuous strategy space
- Perturbations of set-valued dynamical systems, with applications to game theory
- A continuous-time approach to online optimization
- Consistency and cautious fictitious play
- An analog of the minimax theorem for vector payoffs
- Dynamical aspects of evolutionary stability
- Evolutionary dynamics may eliminate all strategies used in correlated equilibrium
- Exponential weight algorithm in continuous time
- Recurrence of the unfit
- Subjectivity and correlation in randomized strategies
- Evolutionarily stable strategies and game dynamics
- Dynamical systems and variational inequalities
- Adjustment dynamics and rational play in games
- The weighted majority algorithm
- On the rate of convergence of continuous-time fictitious play
- Regret-based continuous-time dynamics.
- Riemannian game dynamics
- Learning in games with continuous action sets and unknown payoff functions
- Potential games
- Regret in the on-line decision problem
- Adaptive game playing using multiplicative weights
- Conditional universal consistency.
- Optimal properties of stimulus-response learning models.
- Fictitious play, Shapley polygons, and the replicator equations
- No-regret dynamics and fictitious play
- Stable games and their dynamics
- Large population potential games
- Exponential weight approachability, applications to calibration and regret minimization
- Approachability, regret and calibration: implications and equivalences
- The replicator dynamics does not lead to correlated equilibria
- Best response dynamics for continuous zero-sum games
- Efficient algorithms for online decision problems
- An iterative method of solving a game
- Online Learning and Game Theory. A Quick Overview with recent results and applications
- Learning in Games via Reinforcement and Regularization
- Simple Adaptive Strategies
- Online Learning and Online Convex Optimization
- Time Average Replicator and Best-Reply Dynamics
- Social Stability and Equilibrium
- Penalty-Regulated Dynamics and Robust Learning Procedures in Games
- A new mathematical framework for the study of linkage and selection
- A Randomization Rule for Selecting Forecasts
- Universal Portfolios
- Evolutionary Games and Population Dynamics
- Evolutionary game dynamics
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- Hessian Riemannian Gradient Flows in Convex Programming
- The Nonstochastic Multiarmed Bandit Problem
- Consistency of Vanishingly Smooth Fictitious Play
- Stochastic Approximations and Differential Inclusions
- Stochastic Approximations and Differential Inclusions, Part II: Applications
- Adaptive Heuristics
- On the Global Convergence of Stochastic Fictitious Play
- Internal regret in on-line portfolio selection
- Potential games with continuous player sets
- A general class of adaptive strategies
