Agents that see only total demand can still learn equilibrium: a 0.332 deviation gap in a ten-prosumer microgrid
In Markov games where each reward depends only on an agent's own action and an aggregate of others' actions, a new decentralized algorithm lets every agent use a broadcast aggregate to evaluate the immediate rewards of all candidate actions and to forecast their next losses, without observing opponents' individual actions or the transition kernel. It yields a high-probability regret bound that depends on prediction error while keeping the standard worst-case order; in a ten-prosumer microgrid with stochastic renewables and shared storage, its final unilateral deviation gap is 0.332, below three learning baselines, with favorable user rewards and high renewable utilization.