Related papers: Algorithmic Complexity in Minority Game
This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational…
We analyze grand-canonical minority games with infinite and finite score memory and different updating timescales (from `on-line' games to `batch' games) in detail with various complementary methods, both analytical and numerical. We focus…
We offer a new approach to the information decomposition problem in information theory: given a 'target' random variable co-distributed with multiple 'source' variables, how can we decompose the mutual information into a sum of non-negative…
In this article, we study the dynamics of marking in football matches. To do this, we surveyed and analyzed a database containing the trajectories of players from both teams on the field of play during three professional games. We describe…
We study the dynamics of a version of the batch minority game, with random external information and with different types of inhomogeneous decision noise (additive and multiplicative), using generating functional techniques \`{a} la De…
Algorithmic modeling relies on limited information in data to extrapolate outcomes for unseen scenarios, often embedding an element of arbitrariness in its decisions. A perspective on this arbitrariness that has recently gained interest is…
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea''…
We propose a general interpretation for long-range correlation effects in the activity and volatility of financial markets. This interpretation is based on the fact that the choice between `active' and `inactive' strategies is subordinated…
Coalitional voting games appear in different forms in multi-agent systems, social choice and threshold logic. In this paper, the complexity of comparison of influence between players in coalitional voting games is characterized. The…
This paper proposes a systems theory approach to the modeling of onset and evolution of criminality in a territory, which aims at capturing the complexity features of social systems. Complexity is related to the fact that individuals have…
New continuous and stochastic extensions of the minority game, devised as a fundamental model for a market of competitive agents, are introduced and studied in the context of statistical physics. The new formulation reproduces the key…
In this article, we study the decision-making process of chess players by using a chess engine to evaluate the moves across different pools of games. We quantified the decisiveness of each move during the games using a metric derived from…
Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to which a sequence is random-like. However, each of them…
This work studies the problem of ad hoc teamwork in teams composed of agents with differing computational capabilities. We consider cooperative multi-player games in which each agent's policy is constrained by a private capability…
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…
Approachability has become a standard tool in analyzing earning algorithms in the adversarial online learning setup. We develop a variant of approachability for games where there is ambiguity in the obtained reward that belongs to a set,…
The Interactive Minority Game (IMG) is an online version of the traditional Minority Game in which human players can enter into competition with the traditional computer-controlled agents. Through the rich (and, importantly, analytically…
Most algorithmic studies on multi-agent information design so far have focused on the restricted situation with no inter-agent externalities; a few exceptions investigated truly strategic games such as zero-sum games and second-price…
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…
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…