Search arXivSearch

arXiv · 2604.03559

Fair Aggregation in Virtual Power Plants

Abstract

A virtual power plant (VPP) is operated by an aggregator that acts as a market intermediary, aggregating consumers to participate in wholesale power markets. By setting incentive prices, the aggregator induces consumers to sell energy and profits by providing this aggregated energy to the market. This supply is enabled by consumers' flexibility to adjust electricity consumption in response to market conditions. However, heterogeneity in flexibility means that profit-maximizing VPP pricing can create inequalities in participation and benefit allocation across consumers. In this paper, we develop a fairness-aware pricing framework to analyze how different fairness notions reshape system performance, measured by consumer Nash welfare, total consumer utility, and social welfare. We consider three fairness criteria: energy fairness, which ensures equitable energy provision; price fairness, which ensures similar incentive prices; and utility fairness, which ensures comparable levels of consumer utility. We model the aggregator-consumer interaction as a Stackelberg game and derive consumers' optimal responses to incentive prices. Using a stylized model, we show that profit-only pricing systematically disadvantages less flexible consumers. We further show that energy fairness can either improve or worsen all performance measures, and gains across most measures arise only at moderate fairness levels. Surprisingly, price fairness never benefits less flexible consumers, even when it reduces price disparities. By contrast, utility fairness protects less flexible consumers without benefiting more flexible ones. We validate our findings using data from an experiment in Norway under a tiered pricing scheme. Our results provide regulators and VPP operators with a systematic map linking fairness definitions and enforcement levels to operational and welfare outcomes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Liudong Chen, Hyemi Kim, Adam N. Elmachtoub, Bolun Xu. 2026-04-04. Fair Aggregation in Virtual Power Plants. https://arxiv.org/abs/2604.03559

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT