The k-flip Ising game
Abstract
A partially parallel dynamical noisy binary choice (Ising) game in discrete time of N players on complete graphs with k players having a possibility of changing their strategies at each time moment called k-flip Ising game is considered. Analytical calculation of the transition matrix of game as well as the first two moments of the distribution of =N+/N, where N+ 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 k for the decay of a metastable state is discussed. A presence of the minima at certain k* is attributed to a competition between k-dependent diffusion and restoring forces.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.