Fe b 19 99 The Hamming Distance in the Minority Game
نویسنده
چکیده
We investigate different versions of the minority game, a toy model for agents buying and selling a commodity. The Hamming distance between the strategies used by agents to take decisions is introduced as an analytical tool to determine several properties of these models. The success rate of the agents in an adaptive version of the game is compared with the rate from a stochastic version. It is shown numerically and analytically that the adaptive process is inefficient, increasing the success rate of the unused strategies while decreasing the success rate of the strategies used by the agents. The agents do not do as well as if they were forced to use only one strategy permanently. A version of the game in which the agents strategies evolve is also analyzed using the notion of distance. The agents evolve into a state in which they are all using one strategy, which is again the state that yields the maximum success rate.
منابع مشابه
a da p - or g / 99 02 00 1 v 1 9 F eb 1 99 9 The Hamming Distance in the Minority Game
We investigate different versions of the minority game, a toy model for agents buying and selling a commodity. The Hamming distance between the strategies used by agents to take decisions is introduced as an analytical tool to determine several properties of these models. The success rate of the agents in an adaptive version of the game is compared with the rate from a stochastic version. It is...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملSe p 19 99 Self - organization , resources and strategies in a minority game
We find that the existence of self-organization of the members of a recently proposed minority game, depends on the type of update rules used. The resulting resource distribution is studied in some detail, and a related strategy scheme is considered, as a tool to improve the understanding of the model.
متن کاملImprecise Minority-Based Full Adder for Approximate Computing Using CNFETs
Nowadays, the portable multimedia electronic devices, which employ signal-processing modules, require power aware structures more than ever. For the applications associating with human senses, approximate arithmetic circuits can be considered to improve performance and power efficiency. On the other hand, scaling has led to some limitations in performance of nanoscale circuits. According...
متن کامل