Learning Market Equilibria Preserving Statistical Privacy Using Performative Prediction

We consider a peer-to-peer electricity market modeled as a private network game, where end users minimize their cost by computing their demand and controllable generation. Their nominal demand constitutes sensitive information that they might want to keep private. We prove that the private network game admits a unique variational equilibrium, which depends on the private information of all end users. Thus, to update their strategy, end users rely on randomized readings. A data aggregator is introduced, which aims to learn the end users' private information, while remunerating them depending on the quality of their readings. Using performative prediction, we define a decision-dependent game explicitly taking into account the distribution shift caused by the end users' hidden ability. The decision-dependent game coincides with a Stackelberg game when the end users' hidden abilities are best responses. Further, the market robustness can be quantified by evaluating the efficiency loss as the difference between the social cost in the performatively stable equilibrium and the optimum. We show that under mild assumptions, the performatively stable equilibrium can be found by distributed and sequential variants of the repeated stochastic gradient method while we propose a two-timescale stochastic approximation method to learn Stackelberg equilibrium. Finally, we formulate the data aggregator's optimal contract design as a bilevel optimization problem that we cast as a more tractable nonlinear nonconvex optimization problem which can be solved using simulated annealing. Simulations on small and large scale problem instances illustrate the results.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2025-05-05
DOI
https://doi.org/10.1109/tac.2025.3566920
Citations
1
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Learning Market Equilibria Preserving Statistical Privacy Using Performative Prediction

Mandar Datar, Hélène Le Cadre, Eitan Altman, Mathis Guckert
1 citations
IEEE Transactions on Automatic Control
Privacy-Preserving Technologies in Data
2.48
article

Learning Market Equilibria Preserving Statistical Privacy Using Performative Prediction

Mandar Datar, Hélène Le Cadre, Eitan Altman, Mathis Guckert
article en
1 citations

Abstract

We consider a peer-to-peer electricity market modeled as a private network game, where end users minimize their cost by computing their demand and controllable generation. Their nominal demand constitutes sensitive information that they might want to keep private. We prove that the private network game admits a unique variational equilibrium, which depends on the private information of all end users. Thus, to update their strategy, end users rely on randomized readings. A data aggregator is introduced, which aims to learn the end users' private information, while remunerating them depending on the quality of their readings. Using performative prediction, we define a decision-dependent game explicitly taking into account the distribution shift caused by the end users' hidden ability. The decision-dependent game coincides with a Stackelberg game when the end users' hidden abilities are best responses. Further, the market robustness can be quantified by evaluating the efficiency loss as the difference between the social cost in the performatively stable equilibrium and the optimum. We show that under mild assumptions, the performatively stable equilibrium can be found by distributed and sequential variants of the repeated stochastic gradient method while we propose a two-timescale stochastic approximation method to learn Stackelberg equilibrium. Finally, we formulate the data aggregator's optimal contract design as a bilevel optimization problem that we cast as a more tractable nonlinear nonconvex optimization problem which can be solved using simulated annealing. Simulations on small and large scale problem instances illustrate the results.

IEEE Transactions on Automatic ControlVol. 70(11)
Centre National de la Recherche Scientifique (FR), Institut national de recherche en sciences et technologies du numérique (FR), Université d'Avignon et des Pays de Vaucluse (FR), Université de Lille (FR), Commissariat à l'Énergie Atomique et aux Énergies Alternatives (FR), Laboratoire d'Électronique des Technologies de l'Information (FR), École Centrale de Lille (FR)
Openalex Percentile: Top 12%
Privacy-Preserving Technologies in Data
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.