Related papers: Minority Games
This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class…
We study minimum integer representations of weighted games, i.e., representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if the…
Simple Stochastic Games (SSGs) were introduced by Anne Condon in 1990, as the simplest version of Stochastic Games for which there is no known polynomial-time algorithm. Condon showed that Stochastic Games are polynomial-time reducible to…
Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state…
This dissertation highlights connections between the fields of neural networks, game theory and time series generation. The concept of antipredictability is explained, and the properties of time series that are antipredictable for several…
We introduce two new mathematical games, the Banach-Mazur-Schmidt game and the Banach-Mazur-McMullen game, merging well-known games. We investigate the properties of the games, as well as providing an application to Diophantine…
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…
In this paper, a gentle introduction to Game Theory is presented in the form of basic concepts and examples. Minimax and Nash's theorem are introduced as the formal definitions for optimal strategies and equilibria in zero-sum and…
Feature-based SPL analysis and family-based model checking have seen rapid development. Many model checking problems can be reduced to two-player games on finite graphs. A prominent example is mu-calculus model checking, which is generally…
We study analytically and numerically Minority Games in which agents may invest in different assets (or markets), considering both the canonical and the grand-canonical versions. We find that the likelihood of agents trading in a given…
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…
Complex systems can exhibit unexpected large changes, e.g. a crash in a financial market. We examine the large endogenous changes arising within a non-trivial generalization of the Minority Game: the Grand Canonical Minority Game (GCMG).…
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…
Zero-sum and non-zero-sum (aka general-sum) games are relevant in a wide range of applications. While general non-zero-sum games are computationally hard, researchers focus on the special class of monotone games for gradient-based…
We introduce a new simple game, which is referred to as the complementary weighted multiple majority game (C-WMMG for short). C-WMMG models a basic cooperation rule, the complementary cooperation rule, and can be taken as a sister model of…
We introduce language-based games, a generalization of psychological games [6] that can also capture reference-dependent preferences [7]. The idea is to extend the domain of the utility function to situations, maximal consistent sets in…
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…
We consider a version of large population games whose agents compete for resources using strategies with adaptable preferences. Diversity among the agents reduces their maladpative behavior. We find interesting scaling relations with…
Parity games are simple infinite games played on finite graphs with a winning condition that is expressive enough to capture nested least and greatest fixpoints. Through their tight relationship to the modal mu-calculus, they are used in…
In the time since a merger of quantum mechanics and game theory was proposed formally in 1999, the two distinct perspectives apparent in this merger of applying quantum mechanics to game theory, referred to henceforth as the theory of…