We study minority games in efficient regime. By incorporating the utility function and aggregating agents with similar strategies we develop an effective mesoscale notion of state of the game. Using this approach, the game can be represented as a Markov process with substantially reduced number of states with explicitly computable probabilities. For any payoff, the finiteness of the number of states is proved. Interesting features of an extensive random variable, called aggregated demand, viz. its strong inhomogeneity and presence of patterns in time, can be easily interpreted. Using Markov theory and quenched disorder approach, we can explain important macroscopic characteristics of the game: behavior of variance per capita and predictability of the aggregated demand. We prove that in case of linear payoff many attractors in the state space are possible.
Download