arXiv:2512. 10279v3 Announce Type: replace-cross Abstract: We present an algorithm for computing evolutionarily stable strategies (ESSs) in symmetric perfect-recall extensive-form games of imperfect information.
By Sam Ganzfried
arXiv:2512. 07901v3 Announce Type: replace-cross Abstract: Von Neumann founded both game theory and the theory of self-reproducing automata, but the two programs never merged.
By Kevin Vallier
arXiv:2608. 13297v1 Announce Type: new Abstract: In evolutionary search, a weak child can be a valuable ancestor that makes high-fitness regions reachable.
By Matthew Siper, Ahmed Khalifa, Julian Togelius
arXiv:2608. 13810v1 Announce Type: cross Abstract: We examine the interplay between ordinal, preference-based solution concepts in games and the long-run behavior of game dynamics, asking in particular to what extent the combinatorial data of a game -- its preference graph -- determine the outcomes of no-regret learning dynamics -- such as follow-the-regularized-leader (FTRL).
By Omar Abbadi, Rida Laraki, Panayotis Mertikopoulos
arXiv:2510. 14907v2 Announce Type: replace-cross Abstract: We extend the study of learning in games to dynamics that exhibit non-asymptotic stability.
By Geelon So, Yi-An Ma
The paper presents a mean‑field framework for studying multi‑agent Q‑learning in networked populations, where agents update stateless Q‑values on a fixed graph while the average behavior of the population feeds back to modify the payoff matrix. A deterministic transport equation for the distribution of Q‑values is derived and coupled with a discrete update for the environmental state, and the model is validated against Monte Carlo simulations on several random graph topologies. Results show that the mean‑field system captures macroscopic cooperation dynamics, that environmental feedback reshapes action‑value ordering, and that the timescale of environmental response critically influences learning outcomes.
By Lichen Wang, Shijia Hua, Linjie Liu