The $k$-flip Ising game
By: Kovalenko Aleksandr, Andrey Leonidov
Potential Business Impact:
Helps groups of people make faster decisions.
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 $\varphi=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.
Similar Papers
Phase Transitions in Financial Markets Using the Ising Model: A Statistical Mechanics Perspective
Statistical Finance
Makes stock market patterns predictable with a simple model.
Opinion formation at Ising social networks
Physics and Society
Elite opinions lose power as crowd opinions grow.
Better Models and Algorithms for Learning Ising Models from Dynamics
Machine Learning (CS)
Helps computers learn patterns from changing data.