The affection of noise strategy in the naming game

After investigating the naming game on noise networks, which are constructed as scale-free networks presented by Barabási-Albert (BA). A noise parameter strategy, which governs the frequency of high-degree agents acting as speakers in communication, is introduced. It is found that the agreement time is a non-monotonic function with the noise parameter and there exists an optimal value of the noise parameter which results in the shortest agreement time on naming an object for both scale-free naming games. This phenomenon shows that, although a strong influence of high-degree agents favors agreements achievement, very strong influences inhibit the constringency process, making it even slower than in the absence of influence of high-degree agents. Another phenomenon is that the convergence speed is related to the total memory. These conclusions are beneficial to understand the dynamics of the naming game with noise parameter strategy.