Related papers: Local and global optimization in Parallel Minority…
We show analytically how the fluctuations (i.e. standard deviation) in the Minority Game (MG) can decrease below the random coin-toss limit if the agents use more general, stochastic strategies. This suppression of the standard deviation…
The existence of a phase transition with diverging susceptibility in batch Minority Games (MGs) is the mark of informationally efficient regimes and is linked to the specifics of the agents' learning rules. Here we study how the standard…
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…
A number of prototypical optimization problems in multi-agent systems (e.g., task allocation and network load-sharing) exhibit a highly local structure: that is, each agent's decision variables are only directly coupled to few other agent's…
A matching game is a cooperative profit game defined on an edge-weighted graph, where the players are the vertices and the profit of a coalition is the maximum weight of matchings in the subgraph induced by the coalition. A population…
In this work the properties of multi choice minority games are studied by means of extensive computational simulations. We have considered several ways of rewarding the strategies of the players and compared the resulting behaviours of the…
We show analytically how the fluctuations (i.e. standard deviation) in the Minority Game (MG) can be made to decrease below the random coin-toss limit if the agents use more general behavioral strategies. This suppression of the standard…
This paper proposes a modification to Minority Game (MG) by adding some agents who play majority game into MG. So it is referred to as mix-game. The highlight of this model is that the two groups of agents in mix-game have different bounded…
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$…
Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…
We study a version of the minority game in which one agent is allowed to join the game in a random fashion. It is shown that in the crowded regime, i.e., for small values of the memory size $m$ of the agents in the population, the agent…
We study a multi-agent decision problem in population games, where agents select from multiple available strategies and continually revise their selections based on the payoffs associated with these strategies. Unlike conventional…
Policy optimization methods with function approximation are widely used in multi-agent reinforcement learning. However, it remains elusive how to design such algorithms with statistical guarantees. Leveraging a multi-agent performance…
In the original Evolutionary Minority Game, a segregation into two populations with opposing preferences is observed under many circumstances. We show that this segregation becomes more pronounced and more robust if the dynamics are changed…
We study the statistical properties of the attendance time series corresponding to the number of agents making a particular decision in the minority game (MG). We focus on the analysis of the probability distribution and the autocorrelation…
The submodular maximization problem is widely applicable in many engineering problems where objectives exhibit diminishing returns. While this problem is known to be NP-hard for certain subclasses of objective functions, there is a greedy…
We use the Minority Game as a testing frame for the problem of the emergence of diversity in socio-economic systems. For the MG with heterogeneous impacts, we show that the direct generalization of the usual agents' profit does not fit some…
Mean-payoff games (MPGs) are infinite duration two-player zero-sum games played on weighted graphs. Under the hypothesis of perfect information, they admit memoryless optimal strategies for both players and can be solved in…
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…
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…