No article text was recorded for this version.
fictitious play (iterative strategy adjustment)
Version 1 of 132 papers38 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Unified View of Large-Scale Zero-Sum Equilibrium Computation
- Blog: Learning Equilibria in Cournot Mean Field Games of Controls
- Blog: Mean Field Games Flock! The Reinforcement Learning Way
- Blog: Learning Discrete-Time Major-Minor Mean Field Games
- Blog: Learning to Play No-Press Diplomacy with Best Response Policy Iteration
- Blog: Hardware Trojan Detection Game: A Prospect-Theoretic Approach
- Blog: Regularized Conventions: Equilibrium Computation as a Model of Pragmatic Reasoning
- Blog: Approximating Equilibria in Sequential Auctions with Incomplete Information and Multi-Unit Demand
- Blog: Follower Agnostic Learning in Stackelberg Games
- Blog: Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes
- Blog: Generalization in Mean Field Games by Learning Master Policies
- Blog: Linearly Convergent Variable Sample-Size Schemes for Stochastic Nash Games: Best-Response Schemes and Distributed Gradient-Response Schemes
- Blog: A Market for Accuracy: Classification Under Competition
- Blog: Efficient Nash Computation in Large Population Games with Bounded Influence
- Blog: Signatured Deep Fictitious Play for Mean Field Games with Common Noise
- Blog: Tolling for Constraint Satisfaction in Markov Decision Process Congestion Games
- Blog: Scaling Mean Field Games by Online Mirror Descent
- Blog: Fictitious Play for Mean Field Games: Continuous Time Analysis and Applications
- Blog: Fairness in Selection Problems with Strategic Candidates
- Blog: Solving Continuous Mean Field Games: Deep Reinforcement Learning for Non-Stationary Dynamics
- Blog: Distributed Computation of Equilibria in Misspecified Convex Stochastic Nash Games
- Blog: Solving N-Player Dynamic Routing Games with Congestion: A Mean-Field Approach
- Blog: Regression Equilibrium
- Blog: Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
- Blog: Optimal Offloading Strategies for Edge-Computing via Mean-Field Games and Control
- Blog: Smooth UCT Search in Computer Poker
- Blog: Mean Field Games on Weighted and Directed Graphs via Colored Digraphons
- Blog: Modelling behaviour in author networks with graphon mean field games
- Blog: Model-Free Neural Counterfactual Regret Minimization With Bootstrap Learning
- Blog: Asymmetric Spite in Auctions
- Blog: Mean field equilibrium in dynamic games with complementarities
- Blog: Interdependent Defense Games: Modeling Interdependent Security under Deliberate Attacks
History & citation
Current · Permanent link
- This direction split from Fictitious Play for Stable Multi-Agent Reinforcement Learning (66% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_fictitious_play_iterative_strategy_adjus_a5566e33,
title = {fictitious play (iterative strategy adjustment)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fictitious-play-iterative-strategy-adjustment/rdr_a5566e33f1bc46de85f6a2faea57e89c},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_fictitious_play_iterative_strategy_adjus_a5566e33_v1,
title = {fictitious play (iterative strategy adjustment)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fictitious-play-iterative-strategy-adjustment/rdr_a5566e33f1bc46de85f6a2faea57e89c/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}