oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Effective memory of the minority game  [PDF]
C. H. Hung,S. S. Liaw
Physics , 2006, DOI: 10.1016/j.physa.2007.02.048
Abstract: It is known that the memory is relevant in the symmetric phase of the minority game. In our previous work we have successfully explained the quasi-periodic behavior of the game in the symmetric phase with the help of the probability theory. Based on this explanation, we are able to determine how the memory affects the variance of the system in this paper. By using some particular types of fake history such as periodic type and random type, we determine how efficient the memory has been used in the standard game. Furthermore, the analysis on the effective memory strongly supports the result we proposed previously that there are three distinct phases in the minority game.
Irrelevance of memory in the minority game  [PDF]
Andrea Cavagna
Physics , 1998, DOI: 10.1103/PhysRevE.59.R3783
Abstract: By means of extensive numerical simulations we show that all the distinctive features of the minority game introduced by Challet and Zhang (1997), are completely independent from the memory of the agents. The only crucial requirement is that all the individuals must posses the same information, irrespective of the fact that this information is true or false.
Broken ergodicity and memory in the minority game  [PDF]
J. A. F. Heimel,A. De Martino
Quantitative Finance , 2001, DOI: 10.1088/0305-4470/34/40/103
Abstract: We study the dynamics of the `batch' minority game with market-impact correction using generating functional techniques to carry out the quenched disorder average. We find that the assumption of weak long-term memory, which one usually makes in order to calculate ergodic stationary states, breaks down when the persistent autocorrelation becomes larger than c_c=0.772... We show that this condition, remarkably, coincides with the AT-line found in an earlier static calculation. This result suggests a new scenario for ergodicity breaking in disordered systems.
Self organization in a minority game: the role of memory and a probabilistic approach  [PDF]
E. Burgos,Horacio Ceva
Physics , 2000, DOI: 10.1016/S0378-4371(00)00292-2
Abstract: A minority game whose strategies are given by probabilities p, is replaced by a 'simplified' version that makes no use of memories at all. Numerical results show that the corresponding distribution functions are indistinguishable. A related approach, using a random walk formulation, allows us to identify the origin of correlations and self organization in the model, and to understand their disappearence for a different strategy's update rule, as pointed out in a previous work
Random global lies can enhance social efficiency: The story of Minority Game with a vivid memory  [PDF]
V. Sasidevan
Physics , 2015,
Abstract: The Minority Game (MG) is a prototypical model for an agent-based complex adaptive system. In MG, an odd number of heterogeneous and adaptive agents choose between two alternatives and those who end up on the minority side win. It is known that if $N$ agents play MG, they self-organize to a globally efficient state when they retain the memory of the minority side for the past $m \sim \log_2(N)$ rounds (Challet & Zhang 1997). However, the global efficiency becomes extremely low when the memory of the agents is reduced i.e, when $m << \log_2(N)$. In this work, we consider an MG in which agents use the information regarding the exact attendance on a side for $m$ previous rounds to predict the minority side in the next round. We show that, when employing such strategies, independent of its size, the system is always in a globally efficient state when the agents retain two rounds of information ($m=2$). Even with other values of $m$, the agents successfully self-organize to an efficient state, the only exception to this being when $m=1$ for large values of $N$. Surprisingly, in our model, providing the agents with a random $m=1$ fake history results in a better efficiency than real histories of any length.
Algorithmic Complexity in Minority Game  [PDF]
Ricardo Mansilla Corona
Physics , 1999,
Abstract: In this paper we introduce a new approach for the study of the complex behavior of Minority Game using the tools of algorithmic complexity, physical entropy and information theory. We show that physical complexity and mutual information function strongly depend on memory size of the agents and yields more information about the complex features of the stream of binary outcomes of the game than volatility itself.
The underlying complex network of the Minority Game  [PDF]
Ines Caridi,Horacio Ceva
Physics , 2008,
Abstract: We study the structure of the underlying network of connections in the Minority Game. There is not an explicit interaction among the agents, but they interact via global magnitudes of the model and mainly through their strategies. We define a link between two agents by quantifying the similarity among their strategies, and analyze the structure of the resulting underlying complex networks as a function of the number of agents in the game and the value of the agents' memory, in games with two strategies per player. We characterize the different phases of this system with networks with different properties, for this link definition. Thus, the Minority Game phase characterized by the presence of crowds can be identified with a small world network, while the phase with the same results as a random decision game as a random network. Finally, we use the Full Strategy Minority Game model, to explicitly calculate some properties of its networks, such as the degree distribution, for the same link definition, and to estimate, from them, the properties of the networks of the Minority Game, obtaining a very good agreement with its measured properties.
The Full Strategy Minority Game  [PDF]
Gabriel Acosta,Inés Caridi,Sebastián Guala,Javier Marenco
Computer Science , 2011, DOI: 10.1016/j.physa.2011.07.049
Abstract: The Full Strategy Minority Game (FSMG) is an instance of the Minority Game (MG) which includes a single copy of every potential agent. In this work, we explicitly solve the FSMG thanks to certain symmetries of this game. Furthermore, by considering the MG as a statistical sample of the FSMG, we compute approximated values of the key variable {\sigma}2/N in the symmetric phase for different versions of the MG. As another application we prove that our results can be easily modified in order to handle certain kind of initial biased strategies scores, in particular when the bias is introduced at the agents' level. We also show that the FSMG verifies a strict period two dynamics (i.e., period two dynamics satisfied with probability 1) giving, to the best of our knowledge, the first example of an instance of the MG for which this feature can be analytically proved. Thanks to this property, it is possible to compute in a simple way the probability that a general instance of the MG breaks the period two dynamics for the first time in a given simulation.
Intelligent Minority Game with genetic-crossover strategies  [PDF]
Marko Sysi-Aho,Anirban Chakraborti,Kimmo Kaski
Physics , 2002, DOI: 10.1140/epjb/e2003-00234-0
Abstract: We develop a game theoretical model of $N$ heterogeneous interacting agents called the intelligent minority game. The ``intelligent'' agents play the basic minority game and depending on their performances, generate new strategies using the one-point genetic crossover mechanism. The performances change dramatically and the game moves rapidly to an efficient state (fluctuations in the number of agents performing a particular action, characterized by $\sigma^2$, reaches a low value). There is no ``phase transition'' when we vary $\sigma^2/N$ with $2^M/N$, where $M$ is the ``memory''of an agent.
Equivalence between Bell inequalities and quantum Minority game  [PDF]
Adrian P. Flitney,Maximilian Schlosshauer,Christian Schmid,Wieslaw Laskowski,Lloyd C. L. Hollenberg
Physics , 2008, DOI: 10.1016/j.physleta.2008.12.003
Abstract: We show that, for a continuous set of entangled four-partite states, the task of maximizing the payoff in the symmetric-strategy four-player quantum Minority game is equivalent to maximizing the violation of a four-particle Bell inequality with each observer choosing the same set of two dichotomic observables. We conclude the existence of direct correspondences between (i) the payoff rule and Bell inequalities, and (ii) the strategy and the choice of measured observables in evaluating these Bell inequalities. We also show that such a correspondence between Bell polynomials (in a single plane) and four-player, symmetric, binary-choice quantum games is unique to the four-player quantum Minority game and its "anti-Minority" version. This indicates that the four-player Minority game not only plays a special role among quantum games but also in studies of Bell-type quantum nonlocality.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.