Search arXivSearch

arXiv · 2606.25910

Restoring Incentive Compatibility in Two-Stage Energy Markets with Prosumers

Abstract

A central challenge in modern energy market design is the formulation of a strategy-proof imbalance settlement layer that secures both the economic efficiency of the institution and the stability of the power grid. Public data reveals that the day-ahead market is strategically biased below actual consumer demand. Such empirical observations are explained by active prosumers which provide implementable incentives for demand under-reporting. Active prosumers buy energy in the day-ahead market and sell energy in the real-time market for balancing real-time energy deviations. By under-reporting their demand for the day ahead they inflate real-time imbalances and, under uniform pricing, they dispatch their generation assets more profitably. We model the two-stage institution under linear preferences and benchmark it against its associated competitive equilibria. We show that although consumers' incentives for demand under-reporting vanish when the day-ahead market scales, prosumers' incentives remain lower bounded by a positive gain which depends only on the real-time market generation stack and their shares over it. To restore incentive compatibility under the existing informational constraints, we design a leave-one-out contrastive scoring rule-based penalty that is implemented by the day-ahead market operator, incentivizes prosumers to report their demand truthfully and ensures small charges when participating honestly. We illustrate these results with numerical simulations on synthetic data and evaluate our mechanism on real-market data by first rationalizing demand reports as subjective equilibria of the induced game. Our mechanism demonstrates strong incentive alignment while retaining a low cost for honest participation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikolas Koumpis, Koushik Kar, Leandros Tassiulas, Manolis Zampetakis. 2026-06-24. Restoring Incentive Compatibility in Two-Stage Energy Markets with Prosumers. https://arxiv.org/abs/2606.25910

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