Price and capacity competition in balancing markets with energy storage

Josh A. Taylor; Johanna L. Mathieu; Duncan S. Callaway; Kameshwar Poolla

Home/Archive/arXiv

arXiv · 1503.06851

Price and capacity competition in balancing markets with energy storage

Josh A. Taylor·Johanna L. Mathieu·Duncan S. Callaway·Kameshwar Poolla

View original source ↗Read source document ↗Export metadata ↓

Abstract

Energy storage can absorb variability from the rising number of wind and solar power producers. Storage is different from the conventional generators that have traditionally balanced supply and demand on fast time scales due to its hard energy capacity constraints, dynamic coupling, and low marginal costs. These differences are leading system operators to propose new mechanisms for enabling storage to participate in reserve and real-time energy markets. The persistence of market power and gaming in electricity markets suggests that these changes will expose new vulnerabilities. We develop a new model of strategic behavior among storages in energy balancing markets. Our model is a two-stage game that generalizes a classic model of capacity followed by Bertrand-Edgeworth price competition by explicitly modeling storage dynamics and uncertainty in the pricing stage. By applying the model to balancing markets with storage, we are able to compare capacity and energy-based pricing schemes, and to analyze the dynamic effects of the market horizon and energy losses due to leakage. Our first key finding is that capacity pricing leads to higher prices and higher capacity commitments, and that energy pricing leads to lower, randomized prices and lower capacity commitments. Second, we find that a longer market horizon and higher physical efficiencies lead to lower prices by inducing the storage to compete to have their states of charge cycled more frequently.

Explore related subjects

cs.GT

Keep this discovery

BibTeX RIS

Josh A. Taylor, Johanna L. Mathieu, Duncan S. Callaway, Kameshwar Poolla. 2015-07-01. Price and capacity competition in balancing markets with energy storage. https://arxiv.org/abs/1503.06851

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗