Peer-to-peer energy market clearing gets a learned speedup: a graph-network correction adds no communication and keeps the baseline's convergence guarantee
Clearing peer-to-peer energy markets usually relies on distributed iterations that seek a generalized Nash equilibrium, and the iteration count and communication rounds become a deployment obstacle as participants grow. A KTH team trains a graph-neural-network correction on historical clearing data and adds it to a distributed Douglas–Rachford baseline; the correction decays geometrically, so convergence is inherited from the baseline. On synthetic markets the correction cuts the iterations needed to clear and their spread, and the speedup persists when operating conditions shift to four times the training variability.