Actively Learning Equilibria in Nash Games With Misleading Information

We develop a scheme based on active learning to compute equilibria in a GNEP. Specifically, an external observer (or entity), with little knowledge on the multi-agent process at hand, collects sensible data by probing the agents’ BR mappings, which are then used to recursively update local parametric estimates of these mappings. Unlike fabiani2024active, we consider the realistic case in which the agents share corrupted information with the external entity for, e.g., protecting their privacy. Inspired by a popular approach in stochastic optimization, we endow the external observer with an inexact proximal scheme for updating the local BR proxies. This technique will prove key to establishing the convergence of our scheme under standard assumptions, thereby enabling the external observer to predict an equilibrium strategy even when relying on masked information.