Related papers: Effective memory of the minority game

We consider learning by fictitious play in a large population of agents engaged in single-play, two-person rounds of a symmetric game, and derive a mean-filed type model for the corresponding stochastic process. Using this model, we…

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

In the standard Minority Game, players use historical minority choices as the sole public information to pick one out of the two alternatives. However, publishing historical minority choices is not the only way to present global system…

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system…

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…

Sequential equilibrium is the conventional approach for analyzing multi-stage games of incomplete information. It relies on mutual consistency of beliefs. To relax mutual consistency, I theoretically and experimentally explore the dynamic…

Long memory in the sense of slowly decaying autocorrelations is a stylized fact in many time series from economics and finance. The fractionally integrated process is the workhorse model for the analysis of these time series. Nevertheless,…

We discover the mechanism for the transition from self-segregation (into opposing groups) to clustering (towards cautious behaviors) in the evolutionary minority game (EMG). The mechanism is illustrated with a statistical mechanics analysis…

Competitive dynamics are thought to occur in many processes of learning involving synaptic plasticity. Here we show, in a game theory-inspired model of synaptic interactions, that the competition between synapses in their weak and strong…

While fictitious play is guaranteed to converge to Nash equilibrium in certain game classes, such as two-player zero-sum games, it is not guaranteed to converge in non-zero-sum and multiplayer games. We show that fictitious play in fact…

Convergence of the policy iteration method for discrete and continuous optimal control problems holds under general assumptions. Moreover, in some circumstances, it is also possible to show a quadratic rate of convergence for the algorithm.…

Shortest-path games are two-player zero-sum games played on a graph equipped with integer weights. One player, that we call Min, wants to reach a target set of states while minimising the total weight, and the other one has an antagonistic…

We provide a theoretical description of the Minority Game in terms of crowd effects. The size of the fluctuations arising in the game is controlled by the interplay between crowds of like-minded agents and their anti-correlated partners…

Online learning algorithms that minimize regret provide strong guarantees in situations that involve repeatedly making decisions in an uncertain environment, e.g. a driver deciding what route to drive to work every day. While regret…

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…

Both the phenomenology and the theory of minority games (MG) with more than two strategies per agent are different from those of the conventional and extensively studied case S=2. MGs with $S>2$ exhibit nontrivial statistics of the…

We study a model of a competing population of N adaptive agents, with similar capabilities, repeatedly deciding whether to attend a bar with an arbitrary cutoff L. Decisions are based upon past outcomes. The agents are only told whether the…

Generalization of the minority game to more than one market is considered. At each time step every agent chooses one of its strategies and acts on the market related to this strategy. If the payoff function allows for strong fluctuation of…

This paper investigates the discrete-time asynchronous games in which noncooperative agents seek to minimize their individual cost functions. Building on the assumption of partial asynchronism, i.e., each agent updates at least once within…

Predicting and improving player retention is crucial to the success of mobile Free-to-Play games. This paper explores the problem of rapid retention prediction in this context. Heuristic modeling approaches are introduced as a way of…