Related papers: Algorithmic Complexity in Minority Game
A general notion of information-related complexity applicable to both natural and man-made systems is proposed. The overall approach is to explicitly consider a rational agent performing a certain task with a quantifiable degree of success.…
We consider a model that demonstrates the crucial role of inertia and stickiness in multi-agent systems, based on the Minority Game (MG). The inertia of an agent is introduced into the game model by allowing agents to apply hypothesis…
Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of…
We review the recent approaches to modelling financial markets based on multi-agent systems. After a brief summary of the basic stylised facts observed in real-market time-series we discuss some simple agent-based systems which are…
We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a…
The existence of a phase transition with diverging susceptibility in batch Minority Games (MGs) is the mark of informationally efficient regimes and is linked to the specifics of the agents' learning rules. Here we study how the standard…
We study the roles of social and individual learning on outcomes of the Minority Game model of a financial market. Social learning occurs via agents adopting the strategies of their neighbours within a social network, while individual…
Modern chess engines significantly outperform human players and are essential for evaluating positions and move quality. These engines assign a numerical evaluation $E$ to positions, indicating an advantage for either white or black, but…
We discuss a characterization of complexity based on successive approximations of the probability density describing a system by means of maximum entropy methods, thereby quantifying the respective role played by different orders of…
We study a mixed population of adaptive agents with small and large memories, competing in a minority game. If the agents are sufficiently adaptive, we find that the average winnings per agent can exceed that obtainable in the corresponding…
We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness…
In a one-off Minority game, when a group of players agree to collaborate they gain an advantage over the remaining players. We consider the advantage obtained in a quantum Minority game by a coalition sharing an initially entangled state…
In this paper we study the minority game in the presence of evolution. In particular, we examine the behavior in games in which the dimension of the strategy space, m, is the same for all agents and fixed for all time. We find that for all…
A quantum version of the Minority game for an arbitrary number of agents is considered. It is known that when the number of agents is odd, quantizing the game produces no advantage to the players, but for an even number of agents new Nash…
The field of Game Theory provides a useful mechanism for modeling many decision-making scenarios. In participating in these scenarios individuals and groups adopt particular strategies, which generally perform with varying levels of…
A non-zero-sum 3-person coalition game is presented, to study the evolution of complexity and diversity in cooperation, where the population dynamics of players with strategies is given according to their scores in the iterated game and…
In the evolutionary minority game, agents are allowed to evolve their strategies (``mutate'') based on past experience. We explore the dependence of the system's global behavior on the response time and the mutation threshold of the agents.…
We consider a class of games that are generalizations of the minority game, in that the demand and supply of the resource are specified independently. This allows us to study systems in which agents compete for a resource under different…
The parallel minority game (PMG) extends the classical minority game to many choices, with each agent restricted to two predetermined alternatives. In this condition, minimizing the population variance across all choices is a complex…
Hypothesis Testing Minority Game (HMG) is a variant of the standard Minority Game (MG) that models the inertial behavior of agents in the market. In the earlier study of our group, we find that agents cooperate better in HMG than in the…