Related papers: Minority games with finite score memory
The dynamics of minority games with agents trading on different time scales is studied via dynamical mean-field theory. We analyze the case where the agents' decision-making process is deterministic and its stochastic generalization with…
We present the first study of a dynamical quantum game. Each agent has a `memory' of her performance over the previous m timesteps, and her strategy can evolve in time. The game exhibits distinct regimes of optimality. For small m the…
Optimizing strategic decisions (a.k.a. computing equilibrium) is key to the success of many non-cooperative multi-agent applications. However, in many real-world situations, we may face the exact opposite of this game-theoretic problem --…
Continuous-time assessments of game outcomes in sports have become increasingly common in the last decade. In American football, only discrete-time estimates of play value were possible, since the most advanced public football datasets were…
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…
We demonstrate that minority mechanisms arise in the dynamics of markets because of effects of price impact; accordingly the relative importance of minority and delayed majority mechanisms depends on the frequency of trading. We then use…
We study infinitely repeated games in settings of imperfect monitoring. We first prove a family of theorems that show that when the signals observed by the players satisfy a condition known as $(\epsilon, \gamma)$-differential privacy, that…
We consider an n-player symmetric stochastic game with weak interaction between the players. Time is continuous and the horizon and the number of states are finite. We show that the value function of each of the players can be approximated…
The minority model was introduced to study the competition between agents with limited information. It has the remarkable feature that, as the amount of information available increases, the collective gain made by the agents is reduced.…
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…
We study continuity properties of stochastic game problems with respect to various topologies on information structures, defined as probability measures characterizing a game. We will establish continuity properties of the value function…
The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided…
We consider a dynamical approach to game in extensive forms. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding…
Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case…
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of…
Episodic memory lets reinforcement learning algorithms remember and exploit promising experience from the past to improve agent performance. Previous works on memory mechanisms show benefits of using episodic-based data structures for…
In this paper we present results and analyses of a class of games in which heterogeneous agents are rewarded for being in a minority group. Each agent possesses a number of fixed strategies each of which are predictors of the next minority…
We study deterministic games of infinite duration played on graphs and focus on the strategy complexity of quantitative objectives. Such games are known to admit optimal memoryless strategies over finite graphs, but require infinite-memory…
Within the context of video games the notion of perfectly rational agents can be undesirable as it leads to uninteresting situations, where humans face tough adversarial decision makers. Current frameworks for stochastic games and…
Motivated by the recent applications of game-theoretical learning techniques to the design of distributed control systems, we study a class of control problems that can be formulated as potential games with continuous action sets, and we…