Strategy switches and co-action equilibria in a minority game

Abstract

We propose an analytically tractable variation of the minority game in which rational agents use probabilistic strategies. In our model, $N$ agents choose between two alternatives repeatedly, and those who are in the minority get a pay-off 1, others zero. The agents optimize the expectation value of their discounted future pay-off, the discount parameter being $\lambda$. We propose an alternative to the standard Nash equilibrium, called co-action equilibrium, which gives higher expected pay-off for all agents. The optimal choice of probabilities of different actions are determined exactly in terms of simple self -consistent equations. The optimal strategy is characterized by $N$ real parameters, which are non-analytic functions of $\lambda$, even for a finite number of agents. The solution for $N\le 7$ is worked out explicitly indicating the structure of the solution for larger $N$. For large enough future time horizon, the optimal strategy switches from random choice to a win-stay lose-shift strategy, with the shift probability depending on the current state and $\lambda$.

Cited by in corpus (4)

• Symmetry warrants rational cooperation by co-action in Social Dilemmas
• Co-action provides rational basis for the evolutionary success of Pavlovian strategies
• Effect of detailed information in Minority Game: Optimality of 2-day memory and enhanced efficiency due to random exogenous data
• Achieving perfect coordination amongst agents in the co-action minority game