相关论文: Algorithmic Complexity in Minority Game

We derive a class of macroscopic differential equations that describe collective adaptation, starting from a discrete-time stochastic microscopic model. The behavior of each agent is a dynamic balance between adaptation that locally…

What is the physical origin of player cooperation in minority game? And how to obtain maximum global wealth in minority game? We answer the above questions by studying a variant of minority game from which players choose among $N_c$…

We study the asymptotic macroscopic properties of the mixed majority-minority game, modeling a population in which two types of heterogeneous adaptive agents, namely ``fundamentalists'' driven by differentiation and ``trend-followers''…

We propose and study an evolutionary minority game (EMG) in which the agents are allowed to choose among three possible options. Unlike the original EMG where the agents either win or lose one unit of wealth, the present model assigns one…

By considering diffusion on De Bruijn graphs, we study in details the dynamics of the histories in the Minority Game, a model of competition between adaptative agents. Such graphs describe the structure of temporal evolution of $M$ bits…

We present a dynamical theory of a multi-agent market game, the so-called Minority Game (MG), based on crowds and anticrowds. The time-averaged version of the dynamical equations provides a quantitatively accurate, yet intuitively simple,…

Cooperative games provide a framework to study cooperation among self-interested agents. They offer a number of solution concepts describing how the outcome of the cooperation should be shared among the players. Unfortunately, computational…

This paper gives a critical account of the minority game literature. The minority game is a simple congestion game: players need to choose between two options, and those who have selected the option chosen by the minority win. The learning…

We investigate uniformity properties of strategies. These properties involve sets of plays in order to express useful constraints on strategies that are not \mu-calculus definable. Typically, we can state that a strategy is…

Today's multiagent systems have grown too complex to rely on centralized controllers, prompting increasing interest in the design of distributed algorithms. In this respect, game theory has emerged as a valuable tool to complement more…

With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity…

Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents…

In this work we present a pedagogical introduction to the minority game and various new versions of it with interesting properties, focusing in its applications in socialphysics. For instance, some systems display a kind of social behavior…

A population of heterogenous agents compeeting through a minority rule is investigated. Agents which frequently loose are selected for evolution by changing their strategies. The stationary composition of the population resulting for this…

A finite memory is introduced in the score dynamics of Minority Games. As expected, this removes the dependence of the stationary state on the initial conditions. However, it also causes an unexpected increase of fluctuations in…

We consider a version of large population games whose players compete for resources using strategies with adaptable preferences. The system efficiency is measured by the variance of the decisions. In the regime where the system can be…

We study the parallel Minority Game, where a group of agents, each having two choices, try to independently decide on a strategy such that they stay on minority between their own two choices. However, there are multiple such groups of…

Basic relations for the mean length and algorithmic entropy are obtained by solving a new extremal problem. Using this extremal problem, they are obtained in a most simple and general way. The length and entropy are considered as two…

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.…

In this paper it was developed a modification of the known multiagent model Minority Game, designed to simulate the behavior of traders in financial markets and the resulting price dynamics on the abstract resource. The model was…