SearcharxivSearch

arXiv · 2511.10854

Playing with Peaks: A Game-Theoretic Comparison of Electricity Pricing Mechanisms

Abstract

As electricity consumption grows, reducing peak demand--the maximum load on the grid--has become critical for preventing infrastructure strain and blackouts. Pricing mechanisms that incentivize consumers with flexible loads to shift consumption away from high-demand periods have emerged as effective tools, yet different mechanisms are used in practice with unclear relative performance. This work compares two widely implemented approaches: anytime peak pricing (AP), where consumers pay for their individual maximum consumption, and coincident peak pricing (CP), where consumers pay for their consumption during the system-wide peak period. To compare these mechanisms, we model the electricity market as a strategic game and characterize the peak demand in equilibrium under both AP and CP. Our main result demonstrates that with perfect information, equilibrium peak demand under CP never exceeds that under AP; on the other hand, with imperfect information, the coordination introduced by CP can backfire and induce larger equilibrium peaks than AP. These findings demonstrate that potential gains from coupling users' costs (as done in CP) must be weighed against these miscoordination risks. We conclude with preliminary results indicating that progressive demand cost structures--rather than per-unit charges--may mitigate these risks while preserving coordination benefits, achieving desirable performance in both deterministic and stochastic settings.

Explore related subjects

Keep this discovery

BibTeXRIS

Vade Shah, Jason R. Marden. 2025-11-13. Playing with Peaks: A Game-Theoretic Comparison of Electricity Pricing Mechanisms. https://arxiv.org/abs/2511.10854

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

KEEP EXPLORING

Related papers

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT