The $k$-flip Ising game
Abstract
A partially parallel dynamical noisy binary choice (Ising) game in discrete time of players on complete graphs with players having a possibility of changing their strategies at each time moment called -flip Ising game is considered. Analytical calculation of the transition matrix of game as well as the first two moments of the distribution of , where is a number of players adhering to one of the two strategies, is presented. First two moments of the first hitting time distribution for sample trajectories corresponding to transition from a metastable and unstable states to a stable one are considered. A nontrivial dependence of these moments on for the decay of a metastable state is discussed. A presence of the minima at certain is attributed to a competition between -dependent diffusion and restoring forces.
Keywords
Cite
@article{arxiv.2512.10389,
title = {The $k$-flip Ising game},
author = {Kovalenko Aleksandr and Andrey Leonidov},
journal= {arXiv preprint arXiv:2512.10389},
year = {2025}
}
Comments
31 pages, 15 figures