Sage Journals: Discover world-class research

Abstract

This paper proposes a game-theoretic model to analyze the strategic behavior of inc-dec gaming in market-based congestion management (redispatch). We extend existing models by considering incomplete information about competitors’ costs and a finite set of providers. We find that inc-dec gaming is also a rational behavior in markets with high competition and with uncertainty about network constraints. Such behavior already occurs in our setup of two regions. Comparing market-based redispatch with three theoretical benchmarks highlights a lower efficiency level of market-based redispatch and inflated redispatch payments. Finally, we study seven variations of our basic model to assess whether different market fundamentals or market design changes mitigate inc-dec gaming. None of these variations eliminates inc-dec gaming entirely.

JEL Classification: D43 Market Structure, Pricing, and Design: Oligopoly and Other Forms of Market Imperfection; D44 Auctions; L13 Oligopoly and Other Imperfect Markets; Q41 Energy: Demand and Supply; Prices; Q48 Energy: Government Policy

Keywords

energy market game theory auctions/bidding congestion management inc-dec gaming

1. Introduction

Through much of the twentieth century, the power industry was vertically integrated, mostly fossil-fuel based, and organized regionally. Market liberalization and the energy transition lead to an increased distance between generators and consumers (Hesamzadeh et al. 2021). Renewable energy plants are most productive at sites with high resource availability. The expansion of wind turbines is usually concentrated in windy areas, for example along coastlines. Both wind and solar power stations are preferably built where land prices are low. Further strain on transmission infrastructure results from a closer integration of neighboring electricity markets.

In Europe, among others, electricity markets are organized in large pricing (or “bidding”) zones. Within a bidding zone, the electricity price is uniform for each time step. This implies that prices do not reflect intrazonal transmission constraints, that is, they are operated as if the entire internal network were a copper plate. While this simplification has helped the integration of the European markets into the world’s largest electricity market, it imposes new challenges in terms of increasing congestion in the network.

Various power systems worldwide addressed congestion through the introduction of locational marginal pricing, also known as nodal pricing (see e.g., Joskow 2008). This market design considers transmission constraints in the spot market clearing. While nodal pricing is applied among others in all liberalized U.S. power markets, a transition to nodal pricing in continental Europe is unlikely for political reasons (Eicke and Schittekatte 2022). Instead, a bidding zone review is conducted to better align the delineation of bidding zones. While this process might result in smaller pricing zones in Europe with presumably less congestion, the management of transmission constraints within zones remains necessary as long as the zonal market design persists.

In zonal markets, system operators such as transmission system operators and distribution system operators relieve the overload of network elements within zones through out-of-the market measures. The most important instrument is the “redispatch” of power stations: some market participants who contribute to congestion are ordered to alter their generation or consumption such that the power flow on congested lines is reduced.¹ In many European countries, the use of redispatch has increased over the years, leading to higher costs (ACER and CEER 2021). How to procure redispatch resources is subject to an intense debate. While participating in redispatch has often been mandatory, the European Commission proposed to turn this into voluntary redispatch markets (EU 2019). Here, system operators procure redispatch resources from market participants through auctions.

This paper proposes a game-theoretic model to study strategic behavior in market-based redispatch. It has been long understood that firms factor in profit opportunities from redispatch markets and change their spot market bids accordingly (Hirth and Schlecht 2019). Such behavior is known as “inc-dec gaming.” Inc-dec gaming increases the probability of congestion, and has caused severe problems in the past. Most prominent is the case of California, where strategic behavior contributed to a series of rolling blackouts in 2000/01 (Alaywan et al. 2004; Brunekreeft et al. 2005). This eventually led to the introduction of nodal pricing in California in 2009 (Cramton 2019). Other cases where inc-dec gaming occurred are the Scottish-English border, where congestion strongly increased after the rapid expansion of wind energy in Scotland (Konstantinidis and Strbac 2015), and the Italian market (Graf et al. 2021).

So far, only few authors have studied market-based redispatch by analytically solving for the Nash equilibrium of the game played by market participants. The main reference is Holmberg and Lazarczyk (2015). They assume a continuum of infinitesimally small generators, which have full information about all costs. The authors find that the dispatch under nodal pricing equals the final dispatch of a zonal spot market with uniform pricing followed by market-based pay-as-bid redispatch,² which are both an efficient allocation. Also the local market-based redispatch prices are the same as in markets nodal pricing. A key difference in the outcomes of the two market designs is that generators’ total profits are higher in zonal markets with redispatch. This is for two reasons: first, generators trade at the higher of the uniform zonal price or their local redispatch price. Second, generators at export-constrained nodes can make a profit without producing electricity: they sell electricity at the zonal price and buy it back at the lower local redispatch price. Hence, one main result of Holmberg and Lazarczyk (2015) is that inc-dec gaming also occurs in a perfectly competitive market. This finding is supported by Hirth and Schlecht (2019), who point out a number of consequences of inc-dec gaming.

Another stream of literature studies inc-dec gaming by using bi-level equilibrium modeling (Sarfati and Holmberg 2020; Sarfati et al. 2019). These papers have in common that they assume oligopolistic competition and full information about costs. Their models also provide evidence for inc-dec gaming in redispatch markets. Grimm et al. (2022) combine analytical and numerical modeling and find in a full-information model that market-based redispatch with a system operator that minimizes redispatch costs may result in inefficient (i.e., not welfare-maximizing) outcomes for more than two nodes or regions.

Our paper extends the analysis by Holmberg and Lazarczyk (2015) by relaxing two of their strong assumptions, namely full information about all costs and an infinite set of providers; instead, we assume incomplete information about competitors’ costs and a finite set of providers. The assumption of incomplete information of market participants about their competitors’ costs is motivated by the increasing market shares of renewable energy sources and flexible assets such as storage and flexible consumers. The costs of both types of technologies are difficult to predict for other market participants because the availability of renewable energy resources varies over time and the costs of flexible market participants are mainly determined by opportunity costs. Second, we consider cases with a finite set of generators in a situation of strategic interaction, reflecting these aspects of the oligopoly situation in some electricity markets.

We derive four main results from our model. First, market-based redispatch leads to inefficient outcomes and high payments due to inc-dec gaming. Second, inc-dec gaming occurs even when the number of generators goes to infinity or when the uncertainty about competitors’ costs vanishes. Third, the analysis of the effect of three different market fundamentals (competition and market size, different congestion levels, and the probability of congestion) shows that inc-dec gaming occurs in these setups. Fourth, this also applies to four market design changes proposed in the literature and by practitioners to mitigate inc-dec gaming: the restriction to a single bid for spot and redispatch markets, price caps, uniform pricing in the redispatch market, and a hybrid model, combining cost-based and market-based redispatch.

In the next section, we provide background information on redispatch markets and on inc-dec gaming. Section 3 introduces our basic model as well as its results, and highlights the inefficiency and high payments resulting from market-based redispatch. We analyze how gaming opportunities are affected by fundamental characteristics of power markets in Section 4 and market design changes in Section 5. Section 6 summarizes and concludes.

2. Background: Markets for Redispatch

Redispatch can be organized in multiple ways. In cost-based redispatch, generators are obliged to participate, hence it is also termed mandatory redispatch. The system operator appoints assets that must provide redispatch services and compensates them for the incurred costs. The main problem of this approach is that the incurred costs vary between assets. Because the system operator has incomplete information on these costs, they need to be estimated. Such estimations are already difficult for conventional power plants, where costs depend, among others, on the asset’s efficiency and fuel costs. For flexible demand and storage facilities, including electric vehicles or heat pumps, such an estimation is nearly impossible (for the system operator but also for competitors).³ As a result, these assets are usually not considered in cost-based redispatch. The limited number of assets participating in the redispatch mechanism lowers its economic efficiency and potentially even renders the redispatch impossible if not enough steerable units are available in a deficit region. For comparison, we use cost-based redispatch with a completely informed system operator as a theoretical benchmark in Section 3.2, which we refer to as idealized cost-based redispatch due to the assumption of complete information.

An alternative approach is voluntary market-based redispatch, which is at the core of this paper. In this auction-based mechanism, market participants can submit bids to indicate at which price they are willing to adjust their output or consumption. This facilitates the participation of flexible demand and storage facilities. Proponents of market-based redispatch argue that this mechanism would be more efficient due to the participation of flexible assets. The European Commission is among these proponents. In 2016, it stipulated market-based redispatch as the default mechanism in the Electricity Market Regulation recast, which became effective in 2019 (EU 2019).⁴ Currently, many member states apply market-based redispatch (e.g., Finland, Italy, Sweden, and the Netherlands), others make use of the exemptions mentioned in Footnote 4 and apply cost-based redispatch (e.g., Germany), and a third group applies a combination of market-based and cost-based redispatch (e.g., Denmark, France, and Ireland).

Market-based redispatch can be interpreted as a two-stage market where the first stage is a zonal short-term market (spot market) and the second stage are local redispatch markets. These two market stages open opportunities for inc-dec gaming. When congestion occurs due to the spot market allocation, generators in the importing region prefer selling on their regional redispatch market, where prices are higher than on the zonal spot market, which does not reflect local scarcity in supply. Thus, generators bid sufficiently high in the spot market to avoid being dispatched. Conversely, generators in the export-constraint region can profit by being downward redispatched. They bid low in the spot market, thereby ensuring being dispatched. On the redispatch market, generators with high generation costs buy the electricity back at a lower price.

Such inc-dec gaming in market-based redispatch is problematic for multiple reasons. First, it inflates the volume of redispatch: congestion increases because generators in the deficit area increase their bids in the spot market to benefit from higher redispatch prices. Second, generators that participate in gaming will be able to extract rents, that is, gaming generates windfall profits. Third, gaming is problematic for financial markets, since the spot market, which serves as underlying for futures and forward contracts, becomes less meaningful. This reduces the possibility to hedge prices. Finally, gaming provides perverse investment incentives: it incentivizes the construction of additional generators in surplus regions. In the extreme, it leads to investments of generation assets in the oversupplied region with the sole purpose to engage in gaming but never to actually generate electricity.

3. Strategic Behavior in Market-based Redispatch

In this section, we introduce our game-theoretic model to study the behavior of profit-maximizing generators in the presence of redispatch markets.

3.1. Basic Model

The model is chosen such that it captures the relevant characteristics of the strategic situation of generators under market-based redispatch and at the same time is as simple as possible to enable analytical tractability and the traceability of results. We focus on the behavior of generators and assume price inelastic consumers. This reveals the fundamental incentives under market-based redispatch, which are also transferable to flexible consumers.

The setup of the basic model is depicted in Figure 1. There are $n = n_{A} + n_{B}$ single-unit-supply generators, each of whom can provide one unit of electricity at one of two regions, $A$ and $B$ . This setup can be interpreted as one bidding zone in which congestion occurs only on the transmission line between the regions $A$ and $B$ . The network capacity $c$ for an exchange between $A$ and $B$ is $k$ units, $c = k$ , $k \in {1, 2, 3, \dots}$ .

Figure 1.

Setup of the model in the basic case.

Regions $A$ and $B$ differ with respect to demand and number of generators. Demand at $A$ is $d_{A} = 0$ and demand at $B$ is $d_{B} = 2 k$ . There are $n_{A} \geq 2 k + 1$ generators in $A$ and $n_{B} = 2 k$ generators in $B$ . Thus, generators in $B$ are able to satisfy demand, but there is competition from $A$ , which can satisfy up to half of the demand (due to the transmission capacity).⁵

The game has two stages: In the first stage, generators submit a bid in the spot market, and, depending on the spot market outcome, redispatch markets are conducted in which generators can submit a second bid.

We assume that generators are profit-maximizing and sequentially rational. Each provider knows its generation costs and their relative position in the distribution of generators’ costs. Generation costs are private information, that is, providers do not know their competitors’ costs.

This is modeled as follows. Generation costs are i.i.d. random variables $X_{i}$ , $i \in {1, 2, \dots, n}$ , with the cumulative distribution function $F$ with full support on the interval $[\underline{x}, \bar{x}]$ , which is normalized to $[\underline{x}, \bar{x}] = [0, 1]$ for convenience. The probability density function is denoted by $f$ . The realization $x_{i}$ of $X_{i}$ is private information of generator $i$ (independent private values approach). We also use the conditional random variable $X_{i} ∣ X_{i} < y$ , whose cumulative distribution function and probability density function are given by $G (x ∣ y) = F (x) / F (y)$ and $g (x ∣ y) = f (x) / F (y)$ . The $j$ th order statistic of $n$ draws is denoted by $X_{(j, n)}$ or $X_{(j, n)} ∣ X_{(j, n)} < y$ , and their respective cumulative distribution function and probability density function by $F_{(j, n)}$ and $f_{(j, n)}$ or $G_{(j, n)}$ and $g_{(j, n)}$ .⁶

Consequently, the generators with the lowest costs can be in any of the two regions. The basic model captures both the case that generators’ costs are such that transmission capacity is congested and the case that no congestion occurs. Regions are asymmetric in the sense that congestion of a transmission line is possible only in one direction. Thus, an efficient dispatch only sometimes involves congestion (depending on the realized costs), but if a congestion occurs, its direction is always the same.⁷

Maximum bids in the spot market and the market for upward redispatch are limited to $r$ , where $r \geq 1$ , and minimum bids in the market for downward redispatch to $r = 0$ . These boundaries enable all generators to bid up to or down to their costs. On the spot market, each generator $i$ submits a price bid $b_{Ai}^{S}$ or $b_{Bi}^{S}$ , where the notation indicates region $A$ or $B$ . Bids are sorted in ascending order and the lowest bids win. The spot market price $p$ is determined by the lowest rejected bid. With $d_{B} = 2 k$ , the $2 k$ lowest bids win, and the $(2 k + 1)$ -lowest bid determines the clearing price.

Market-based redispatch is conducted if the spot market allocation is not feasible due to the grid constraint. In our basic model, in which transmission capacity is limited to $c = k$ , $ℓ$ units of electricity will be redispatched when $k + ℓ$ generators with a winning bid in the spot market are located in $A$ . Then, in region $A$ , $k + ℓ$ generators with a winning bid in the spot market compete for downward redispatch of $ℓ$ units by submitting bids $b_{Ai}^{R}$ . In $B$ , generators without a winning bid in the spot market compete for upward redispatch of $ℓ$ units by submitting bids $b_{Bi}^{R}$ . After the spot market is cleared, only the market price is published, not the individual bids of the generators. That is, participants in the redispatch market may gain only limited knowledge about their competitors’ costs from the spot market (in equilibrium, they will be able to infer the $(2 k + 1)$ -lowest cost of a generator in $A$ ).

The redispatch markets are organized as auctions with pay-as-bid pricing.⁸ At the redispatch stage, demand for upward and downward redispatch is known. In the auction for downward redispatch, the highest bids win and the winners pay their bid (i.e., the provider buys the electricity back); in the auction for upward redispatch, the lowest bids win and the winners are paid their bid (i.e., the provider sells the electricity). Thus, a provider that is downward redispatched has a profit (payoff) equal to the spot market price minus the provider’s redispatch bid; a provider that is upward redispatched has a profit equal to the provider’s redispatch bid minus generation costs.

In this game there exists a Perfect Bayesian Equilibrium in which only generators in $A$ win in the spot market and redispatch is always necessary.⁹ Since in both $A$ and $B$ the equilibrium bidding function is symmetric, we omit the provider index $i$ . The proposition is proven in Appendix A.1.

Proposition 1 The game has a Perfect Bayesian Equilibrium in which only generators in $A$ are dispatched in the spot market, redispatch is always necessary, and the final dispatch is inefficient.

The equilibrium bidding functions $β_{A}^{S} (x)$ and $β_{B}^{S} (x)$ in the spot market are

β_{A}^{S} (x) = \int_{0}^{x} t g_{(k, 2 k - 1)} (t ∣ x) dt = E [X_{(k, 2 k - 1)} ∣ X_{(2 k - 1, 2 k - 1)} < x] for all x \in (0, 1]

(1)

β_{B}^{S} (x) \in [E [X_{(k, 2 k - 1)}], r] arbitrary for all x \in [0, 1] .

(2)

The equilibrium bidding functions $β_{A}^{R} (x)$ and $β_{B}^{R} (x)$ in the redispatch markets comprise

\begin{matrix} β_{A}^{R} (x) = \frac{\int_{0}^{x} t g_{(k, 2 k - 1)} (t ∣ y) dt}{G_{(k, 2 k - 1)} (x ∣ y)} = E [X_{(k, 2 k - 1)} ∣ X_{(k, 2 k - 1)} < x, X_{(2 k - 1, 2 k - 1)} < y] \end{matrix}

(3)

for all $x \in (0, y]$ , where $y = {(β_{A}^{S})}^{- 1} (p)$ and p is the spot market price,

\begin{matrix} β_{B}^{R} (x) = \frac{\int_{x}^{1} t f_{(k, 2 k - 1)} (t) dt}{1 - F_{(k, 2 k - 1)} (x)} = E [X_{(k, 2 k - 1)} ∣ X_{(k, 2 k - 1)} > x] for all x \in [0, 1) . \end{matrix}

(4)

Boundary bids are $β_{A}^{S} (0) = 0$ , $β_{A}^{R} (0) = 0$ , and $β_{B}^{R} (1) = 1$ .¹⁰

In the equilibrium, all spot market bids of generators in $A$ are lower than the bids of generators in $B$ , $β_{A}^{S} (x) \leq E [X_{(k, 2 k - 1)}]$ for all $x$ . Thus, $2 k$ generators in $A$ win in the spot market, and the redispatch of $k$ units is always necessary. Note that the probability for congestion would be much lower if generators did not engage in gaming and bid their generation costs in the spot market ( $β^{S} (x) = x$ ). For $k = 1$ , redispatch would occur only with probability $(\begin{matrix} n_{A} \\ n_{A} - 2 \end{matrix}) / (\begin{matrix} n_{A} + 2 \\ n_{A} \end{matrix})$ , for example, 30% if $n_{A} = 3$ .

The equilibrium bidding functions $β_{A}^{S} (x)$ , $β_{A}^{R} (x)$ , and $β_{B}^{R} (x)$ are strictly increasing in $x$ . Thus, the $2 k$ generators with the lowest costs in $A$ win in the spot market, and the spot market price $p$ is determined in $A$ by the provider with the $(2 k + 1)$ -lowest costs. In the redispatch markets, in $A$ the $k$ generators with the higher costs among the $2 k$ generators that win in the spot market are downward redispatched, and in $B$ , the $k$ generators with the lowest costs are upward redispatched.

As $β_{A}^{S} (x) < x$ for all $x \in (0, 1]$ , the spot market price is below the costs of the price-setting provider. Generators in $A$ bid weakly lower in the spot market than in the redispatch market: $β_{A}^{S} (x) = β_{A}^{R} (x)$ for $x \in [0, y]$ and $k = 1$ , and $β_{A}^{S} (x) < β_{A}^{R} (x)$ for $x \in (0, y)$ and $k \geq 2$ . However, their bid in the redispatch market is of course lower than the spot market price, $β_{A}^{R} (x) \leq p$ .

The intuition behind the equilibrium is as follows. First consider the second stage, the redispatch markets. On the redispatch market in region $A$ , the $2 k$ spot market winners compete for buying (back) $k$ units and saving their costs. The bidding function $β_{A}^{R} (x)$ is the same as in a pay-as-bid forward auction with $k$ units and $2 k$ generators (Krishna 2010), with costs distributed between zero and $y$ , the costs of the price-setting provider in the spot market. That is, generators bid the (conditional) expected costs of their median competitor under the condition that these expected costs are below the own costs.¹¹ In the redispatch market in $B$ , generation must be increased compared to the spot market clearing. $2 k$ generators compete for selling $k$ units and, thus, the bidding function $β_{B}^{R} (x)$ is the same as in a pay-as-bid reverse (procurement) auction with $k$ units and $2 k$ generators. That is, generators bid the expected costs of their median competitor under the condition that these are above their own costs. In the spot market, generators in $A$ compete for the spot market payment, which either implies incurring their costs (if they are among the spot market winners with the lower costs) or buying back their electricity at the price $β_{A}^{R} (x)$ (if they are among the spot market winners with the higher costs). Generators in $B$ abstain from competing in the spot market because there is less competition for the k units at their redispatch market than in the spot market.

A provider who wins at the worst spot market price conditional on winning, that is, a price equal to the provider’s bid, knows the price-setting provider has the same type, $y = x$ . Such a provider bids in the redispatch market as in the spot market, $β_{A}^{R} (x) = E [X_{(k, 2 k - 1)} ∣ X_{(k, 2 k - 1)} < x, X_{(2 k - 1, 2 k - 1)} < x] = E [X_{(k, 2 k - 1)} ∣ X_{(2 k - 1, 2 k - 1)} < x] = β_{A}^{S} (x)$ . Then this provider will win in the redispatch market and buy back the electricity at the same price as the spot market price, so the profit is zero, as if the provider had not won in the spot market. A provider who has bid below the spot market price has a probability of less than one of winning in the redispatch market and buying back the electricity at a positive profit (as the spot market price is higher than that generator’s redispatch bid), and also has a positive probability of having to produce and making a loss.

In both regions, the expected profit of generators is positive and decreases with their costs. Moreover, the expected profit of a provider in $B$ is higher than of a provider in $A$ with the same costs. Unlike the generators in $B$ , the generators in $A$ with $x > 0$ run the risk of incurring a loss because they bid below their costs in the spot market, $β_{A}^{S} (x) < x$ for $x \in (0, 1]$ . Therefore, it is possible for a provider to win in the spot market at a price $p$ below $x$ , but not win in the redispatch market. This provider suffers a loss of $p - x$ .

In this setting, the generators’ uncertainty about the competitors’ costs requires them to trade off the different potential outcomes that may result from their bid, making their decisions risky. As a result of the uncertainty, the final dispatch may not be efficient, that is, it is not the cost-optimal subset of generators that operate. Inefficiency occurs whenever more than $k$ of the $2 k$ generators with the lowest costs are located in region $B$ . In this case, in the efficient outcome all these lowest-costs generators in $B$ generate electricity, but in equilibrium only $k$ do so. Thus, inc-dec gaming in an incomplete information setup adds a source of inefficiency not present in a full information model with atomistic generators, for which Grimm et al. (2022) find an inefficient dispatch only for settings with at least three regions.

Furthermore, note that in the equilibrium outcome, the maximum volume of $k$ units are always redispatched. This holds even for cost realizations where more than $k$ of the $2 k$ generators with the lowest costs are located in B. If costs were common knowledge in this case, there would be an equilibrium where generators bid their costs in the spot market and no congestion occurs.¹² In that sense, as cases without congestion have positive probability (70% for $k = 1$ and $n_{A} = 3$ , see above), incomplete information about costs increases the probability and expected volume of redispatch.

In addition to the equilibrium in Proposition 1, others may exist. However, all equilibria with a positive redispatch probability for the generators have in common that the generators in $A$ bid below their costs in the spot market, $β_{A}^{S} (x) < x$ , and a generator in $B$ submits a higher bid than the same type in $A$ , $β_{B}^{S} (x) > β_{A}^{S} (x)$ for all $x > 0$ .¹³ This is due to the inc-dec incentives. Without transmission constraint, it is optimal (weakly dominant strategy) for the generators to bid their costs in the spot market. With the possibility of redispatch, generators in $A$ have an incentive to bid below their costs because they have the opportunity to make a positive profit through downward redispatch by winning in the spot market. Generators in $B$ have an incentive to bid above the same type in $A$ because they have the opportunity to make a positive profit through upward redispatch if they do not win in the spot market. The equilibrium in Proposition 1 is the most extreme form of this bidding difference between the generators in $A$ and in $B$ . Moreover, this bidding difference, combined with the different options for generators in $A$ and $B$ , implies that with high competition in $A$ , an equilibrium must always have the separation of the generators in $A$ and $B$ as in the equilibrium in Proposition 1. In this case, even the lowest-cost generators in $B$ have a negligible chance of winning, and the expected spot market price is very low, making redispatch the better alternative. Thus, no generator in $B$ has an incentive to compete with the more aggressively bidding generators in $A$ in the spot market.

3.2. Benchmarking Market-based Redispatch

To highlight why market-based redispatch with strategic behavior results in higher generation costs and electricity payments for consumers, we compare the approach with three theoretical benchmarks: an unconstrained grid, idealized cost-based redispatch with a completely informed system operator, and the Vickrey-Clarke-Groves (VCG) mechanism, which incents truthful bidding and results in a cost-efficient dispatch. Note that these benchmarks are no practical alternatives to market-based redispatch. Instead, the comparison with these theoretical benchmarks helps to understand where inefficiency and high payments arise in market-based redispatch and what causes them. The comparisons in this section also hold for uniform pricing in the redispatch markets and a single bid for spot and redispatch markets because these are outcome-equivalent to the basic model.

As a first benchmark, we compare market-based redispatch with the case of unconstrained grids (deviating from the basic model). Redispatch becomes dispensable when the network is expanded to the extent that congestion no longer occurs. Then, generators have an incentive to bid their marginal costs in the spot market, $β (x) = x$ . In our model, a grid capacity of $c \geq 2 k$ satisfies this criterion. Whether this is economically efficient depends on the costs of network expansion, which we do not consider in this comparison. In practice, it is usually efficient to accept a certain share of congestion in order to not expand transmission infrastructure for rare events (Green 2003).

The second theoretical benchmark is what we call idealized cost-based redispatch. This benchmark represents a fictitious situation in which the system operator can limit the redispatch payments to the generation costs, that is, it can enforce price discrimination. This is only possible when the system operator has full information about the costs of all generators (deviating from the basic model). In this case, generators always have the incentive to bid their costs in the spot market, $β (x) = x$ . There is no benefit of being upward redispatched because the resulting compensation equals the costs. Thus, a generator prefers to win in the spot market if its costs are below the spot market price. There is also no benefit from being downward redispatched because the payoff then equals the spot market price minus the costs. Hence, by bidding above costs in the spot market, the generator decreases the probability of winning and by bidding below costs, the generator increases the chance of winning only when it would be better not to win in the spot market auction because the spot market price is below costs.

The third benchmark is the Vickrey-Clarke-Groves (VCG) mechanism. This one-step mechanism determines an efficient (i.e., generation-cost-minimizing) dispatch given the transmission capacity and provides a robust incentive (a weakly dominant strategy) to bid the costs, $β (x) = x$ (Clarke 1971; Groves 1973; Krishna 2010; Vickrey 1961).¹⁴ It thus provides the theoretical benchmark of an efficient allocation in our setting with incomplete information and non-atomistic generators. In the VCG mechanism, each provider is paid the difference between the sum of the other generators’ (reported) costs in the cost-minimizing allocation without this provider and the sum of the (reported) costs of the other generators in the cost-minimizing allocation with this provider. Noteworthy, a result of the VCG mechanism in our setting is locationally differentiated prices depending on the relevance of the transmission constraint; thus, it is an incentive-compatible version of nodal pricing.¹⁵ In contrast to idealized cost-based redispatch, the auctioneer is not assumed to have and use information about the generators’ costs before conducting the mechanism. Thus, while the generation costs are the same under the VCG mechanism and under idealized cost-based redispatch, total electricity payments with VCG are higher because generators receive an information rent.

Table 1 provides an overview of expected generation costs and electricity payments in the spot and the redispatch markets; see Appendix A.2 for the associated calculations. The electricity payments are the spot market payments (two times the spot market price) plus the redispatch payments. To simplify the comparison, we assume a uniform distribution ( $X ~ U [0, 1]$ ) and set $k = 1$ (i.e., demand in $B$ in the basic model is $d_{B} = 2$ ). Figure 2 visualizes the costs and payments for $n_{A} = 3$ .

Table 1.

Generation Costs and Payments Under Market-based Redispatch and the Three Theoretical Benchmarks for Uniformly Distributed Costs $X ~ U [0, 1]$ , $k = 1$ , $n_{A} \geq 3$ .

Scenario	Generation costs	Spot market payments	Redispatch payments	Energy payments
Market-based redispatch	$\frac{1}{3} + \frac{1}{n_{A} + 1}$	$2 \cdot \frac{3}{2 (n_{A} + 1)}$	$\frac{2}{3} - \frac{1}{n_{A} + 1}$	$\frac{2}{3} + \frac{2}{n_{A} + 1}$
Benchmarks
Unconstrained grid	$\frac{3}{n_{A} + 3}$	$2 \cdot \frac{3}{n_{A} + 3}$	–	$\frac{6}{n_{A} + 3}$
Idealized cost-based redispatch	$\frac{n_{A}^{2} + 8 n_{A} + 18}{3 (n_{A} + 2) (n_{A} + 3)}$	$2 \cdot \frac{3}{n_{A} + 3}$	$\frac{n_{A} (n_{A} - 1)}{3 (n_{A} + 2) (n_{A} + 3)}$	$\frac{n_{A}^{2} + 17 n_{A} + 36}{3 (n_{A} + 2) (n_{A} + 3)}$
VCG mechanism	$\frac{n_{A}^{2} + 8 n_{A} + 18}{3 (n_{A} + 2) (n_{A} + 3)}$	–	–	$\frac{2 (n_{A}^{2} + 8 n_{A} + 18)}{3 (n_{A} + 2) (n_{A} + 3)}$

Figure 2.

Generation costs and payments under market-based redispatch and the three theoretical benchmarks for uniformly distributed costs $X ~ U [0, 1]$ , $k = 1$ , $n_{A} = 3 .$

Generation costs are highest with market-based redispatch due to the inefficient final dispatch in the case when the two cheapest generators are located in $B$ . By comparison, idealized cost-based redispatch and the VCG mechanism allocate efficiently, that is, they lead to the lowest generation costs given the transmission capacity $c = 1$ , which requires generation of at least one unit in $B$ . Generation costs are lowest under unconstrained grids because it results in an efficient dispatch of generators and does not result in congestion. The difference in generation costs between market-based redispatch and the VCG mechanism is the efficiency loss caused by the strategic behavior under market-based redispatch. As $n_{A}$ increases, the generation costs of market-based redispatch, idealized cost-based redispatch, and the VCG mechanism converge because it becomes more likely that generation by only one unit in $B$ is efficient. In the limit ( $n_{A}$ to infinity), generation costs are zero in $A$ and 1/3 in $B$ , the spot market price and spot market payments are zero, and the redispatch payments and energy payments are 2/3. The cost advantage of unconstrained grids increases in $n_{A}$ .

The spot market price with market-based redispatch differs from the benchmark scenarios because it is determined by the competitive bids in region $A$ . In the example, the spot market price is lower with market-based redispatch. As $n_{A}$ goes to infinity, the spot market price in each scenario converges to zero due to intense competition.

Total energy payments with market-based redispatch are higher than in the benchmark scenarios due to the additional redispatch payments. The difference in energy payments between market-based redispatch and the VCG mechanism is the additional payment caused by the strategic behavior under market-based redispatch. As $n_{A}$ increases, the difference in payments between the scenarios with $c = 1$ and the scenario with unconstrained grids ( $c = 2$ ) increases. As $n_{A}$ goes to infinity, redispatch payments under idealized cost-based redispatch converge to 1/3, which equals the expected generation costs of the redispatched provider in $B$ , and redispatch costs with market-based redispatch converge to 2/3 (the expected generation costs of the provider that does not produce) due to the information rent to the producing provider in $B$ . With the VCG mechanism, the information rent in the limit is also 2/3. Even in the limit, generators in $B$ make a profit under market-based redispatch and the VCG mechanism because the transmission constraint limits competition from region A. Total energy payments converge to zero with unconstrained grids, to 1/3 with idealized cost-based redispatch, and to 2/3 with market-based redispatch and with the VCG mechanism.

4. Impact of Market Fundamentals

This section focuses on market fundamentals that might influence the likelihood of inc-dec gaming. To this end, we model and analyze the impact of competition and market size, the probability and the level of congestion, as well as the impact of uncertainty about congestion. Formal derivations of the results are given in Appendix A.3.

4.1. Competition and Market Size

To assess the impact of competition and market size, we vary the number of generators $n_{A}$ and investigate the limit cases of $n_{A}$ or $k$ going to infinity.

In the basic model, we have excluded the case $n_{A} = 2 k$ , which differs from the case $n_{A} > 2 k$ because there is no competition within $A$ for the $2 k$ units. The bidding functions given in Proposition 1 form also an equilibrium in case $n_{A} = 2 k$ . However, then a bid $β_{B}^{S}$ from market $B$ determines the spot market price, which can therefore be very high. Furthermore, in this case, bids $β_{A}^{S}$ just need to be sufficiently low to prevent spot market competition from region $B$ and to assure winning $2 k$ units (i.e., $β_{A}^{S} (x) \leq E [X_{(k, 2 k - 1)}]$ given $β_{B}^{S}$ from [2]).

Next, consider the case of $n_{A}$ growing infinitely large. The basic model comprises all $n_{A} \geq 2 k + 1$ , and the equilibrium bidding functions are independent of the number of generators. This is because competition in $A$ boils down to competition between (the cheapest) $2 k$ generators in the redispatch market to avoid producing $k$ units (given that bidding in the spot market is sufficiently aggressive to prevent generators in $B$ from desiring to win). If $n_{A}$ goes to infinity, although bidding functions are unchanged, the spot market price and the profits of generators in $A$ go to zero due to the selection of the generators with the lowest costs. Thus, an increase in competition lowers the effect of inc-dec gaming but does not dissolve its incentives.

To compare our model with a model of perfect competition and atomistic generators (Holmberg and Lazarczyk 2015), we increase the number of generators in our game and make them smaller at the same time. To do this, we let $k$ go to infinity, but keep the transmission capacity $c$ and the demand $d_{B}$ constant. We set $c = 1$ and $d_{B} = 2 c = 2$ for all $k$ . As $k$ increases, the number of generators $n_{A}^{k}$ and $n_{B}^{k}$ increases, while they become smaller, each providing $1 / k$ energy units. Let $n_{A}^{1} \geq 3$ be the number of generators in $A$ for $k = 1$ , and $n_{A}^{k} = {kn}_{A}^{1} \geq 3 k$ for $k \geq 1$ . Similarly, $n_{B}^{1} = 2$ and $n_{B}^{k} = {kn}_{B}^{1} = 2 k$ . So the total capacity in $A$ is equal to $n_{A}^{1}$ and in $B$ equal to $n_{B}^{1}$ for all $k$ . The size and structure of the market in terms of supply, demand, and transmission capacity is therefore the same for all $k$ . Only the size and number of generators change. To cover demand $d_{B}$ , $k d_{B} = 2 k$ generators are required, and the transmission capacity $c$ allows $kc = k$ generators in $A$ to deliver to $B$ . As $k$ goes to infinity, the non-cooperative game converges to a non-atomic limit game.¹⁶

With $n_{A}^{1} \geq 3$ , $d_{B} / n_{A}^{1} = κ \in (0, 1)$ for $k \geq 1$ . If $k$ goes to infinity, according to (5), the equilibrium bid $β_{A}^{S} (x)$ in (1) converges to the median of the conditional distribution $F (s ∣ s \leq x)$ , which is equal to $F^{- 1} (F (x) / 2)$ . Thus, if $2 k$ of $n_{A}$ generators in $A$ win in the spot market, the spot market price $p$ converges to $F^{- 1} (κ / 2)$ . According to (7), the redispatch bid $β_{A}^{R} (x)$ in (3) converges to $x$ for all $x \leq p$ , and converges to $p$ for all $x > p$ . According to (8), the redispatch bid $β_{B}^{R} (x)$ in (4) converges to the median of $F$ , which is equal to $F^{- 1} (1 / 2)$ , for all generators with costs below the median and to $x$ for all generators with costs higher than the median.

\begin{matrix} \lim_{k \to \infty} β_{A}^{S} (x) = F^{- 1} (\frac{F (x)}{2}) for x \in [0, 1] \end{matrix}

(5)

\begin{matrix} \lim_{k \to \infty} β_{B}^{S} (x) \in [F^{- 1} (\frac{1}{2}), r] \end{matrix}

(6)

\begin{matrix} x if x \in [0, F^{- 1} (\frac{κ}{2})] \\ F^{- 1} (\frac{κ}{2}) if x \in (F^{- 1} (\frac{κ}{2}), F^{- 1} (κ)] \end{matrix}

(7)

\begin{matrix} \lim_{k \to \infty} β_{B}^{R} (x) = {\begin{matrix} F^{- 1} (\frac{1}{2}) if x \in [0, F^{- 1} (\frac{1}{2})] \\ x if x \in (F^{- 1} (\frac{1}{2}), 1] \end{matrix} \end{matrix}

(8)

In the limit, generators in $A$ with costs below $p$ deliver electricity, while those with costs higher than $p$ are redispatched or do not win in the spot market. Thus, the profits of the producing generators are positive in the limit, while the profits of the redispatched generators go to zero. A profit of zero is also made by generators whose costs are higher than $F^{- 1} (κ / 2)$ who thus are not dispatched in the spot market. Generators in $B$ with costs below the median $F^{- 1} (1 / 2)$ deliver electricity, while those with costs higher than the median do not. The profits of the redispatched generators are positive, while the profit of the other generators in $B$ is zero.

When $k$ goes to infinity, given the transmission constraint, the outcome is efficient because the marginal generator in $A$ does not have higher costs than the marginal generator in $B$ ( $κ / 2 \leq 1 / 2$ ).

In the limit, our model is one of full information with an infinite number of generators, and the equilibrium outcome is the same as in the equilibrium identified by Holmberg and Lazarczyk (2015). Thus, in the limit, inc-dec gaming persists, but the inefficiency vanishes, as in a setting with perfect competition.

4.2. Varying Cost-related Congestion

We vary cost-related congestion by varying both the probability of cost-related congestion (i.e., the probability of generation costs for which the transmission capacity prevents that the generators with the lowest costs satisfy the demand) and the cost-related congestion level (i.e., the maximum amount to be redispatched $d_{B} - k$ ).

In the basic model, the maximum amount to be redispatched is $d_{B} - k = 2 k - k = k$ units and, whereas maximum redispatch always occurs in equilibrium, the amount of cost-related redispatch is usually less than $k$ and the probability of cost-related congestion is less than one (see Section 3.1).

We extend our analysis by also studying scenarios where this is not the case, that is, where congestion occurs with probability zero, or where the congestion level is higher than in the basic model. For this purpose, we vary the demand. Since we want to identify and illustrate the basic effects of varying congestion, for simplicity we set $k = 1$ and consider the two cases $d_{B} = 1$ and $d_{B} = 3$ (and keep $n_{A} \geq 2 k + 1 = 3$ and $n_{B} = 2 k = 2$ ).

If $d_{B} = 1$ , congestion is impossible because total demand can be covered by any provider. Any spot market outcome is feasible, and the redispatch stage can be discarded. Therefore, the spot market corresponds to a second-price auction, in which bidding the costs is a weakly dominant strategy. Thus, $β_{A}^{S} (x) = x$ and $β_{B}^{S} (x) = x$ constitute an equilibrium.

If $d_{B} = 3$ , one unit of electricity must be produced in $A$ to cover the total demand, while the other two units of electricity must be produced in $B$ due to the transmission capacity $c = 1$ . Therefore, both generators in $B$ will deliver electricity no matter which bids they submit. Assuming $n_{A} > 3$ ,¹⁷ the equilibrium bidding functions are

\begin{matrix} β_{A}^{S} (x) = \int_{0}^{x} t g_{(1, 2)} (t ∣ x) dt for all x \in (0, 1], \end{matrix}

(9)

\begin{matrix} β_{B}^{S} (x) \in [E [X_{(1, 2)}], r] arbitrary for all x \in [0, 1], \end{matrix}

(10)

\begin{matrix} β_{A}^{R} (x) = \frac{\int_{0}^{x} t g_{(1, 2)} (t ∣ y) dt}{G_{(1, 2)} (x ∣ y)} for all x \in (0, 1], \end{matrix}

(11)

\begin{matrix} β_{B}^{R} (x) = r for all x \in [0, 1], \end{matrix}

(12)

where $y = {(β_{A}^{S})}^{- 1} (p) > x$ denotes the costs of the price-setting provider in the spot market. The boundary bids are $β_{A}^{S} (0) = 0$ and $β_{A}^{R} (0) = 0$ .

Note that bidding in the redispatch market in region $A$ can also be expressed as $β_{A}^{R} (x) = E [X_{(1, 2)} ∣ X_{(1, 2)} < x, X_{(2, 2)} < y]$ . Thus, generators bid the expected costs of the lower of their two competitors (whom they have to beat), given that the lower of the two competitors’ costs is less than $x$ and the higher of the two competitors’ costs is less than $y$ . Similarly, their bids in the spot market can be expressed as $β_{A}^{S} (x) = E [X_{(1, 2)} ∣ X_{(2, 2)} < x]$ , with the intuition identical to that in the basic model (in the worst case conditional on winning, where $y = x$ and the spot market price is $β_{A}^{S} (x)$ , the provider is just indifferent between winning and losing in the spot market). In $B$ , the two generators face no competition in the redispatch market and thus bid the maximum bid $r$ . On the spot market, they bid such that they do not win, as in the basic model.

Comparing the cases $d_{B} \in {1, 2, 3}$ , we find that generators in $A$ react to higher demand (i.e., higher congestion) by bidding more aggressively (i.e., lower) in the spot market, but generators in $B$ bid competitively in the spot market only if $d_{B} = 1$ . Redispatch is necessary only if $d_{B} \in {2, 3}$ . With higher demand, the redispatched amount is higher and therefore competition in the redispatch markets is lower. Thus, bids in the forward redispatch market in region $A$ decrease and bids in the reverse redispatch market in region $B$ increase. These bids feed back into the spot market. Notably, expected payoffs of generators in $A$ do not vary with $d_{B} \in {2, 3}$ because in each case one unit is generated in A.¹⁸

4.3. Uncertainty About Congestion

As a further variation of the model, we study the case of uncertainty about congestion in the network. One motivation for this sensitivity analysis is the claim that inc-dec gaming would only occur when congestion is well predictable.

Methodologically, we implement the uncertainty about congestion as stochastic demand, that is, generators do not know the level of demand when submitting their bids in the spot market. This is equivalent to uncertainty about congestion because the level of demand determines whether and how much the network is congested. It is not necessary for generators to know the actual demand after the spot market has cleared because then only redispatch quantities matter. The results of the models are given in Appendix A.3.3.

For simplicity, we again set $k = 1$ , and examine the case that demand $d_{B}$ is stochastic in ${2, 3}$ each with probability 1/2 and the case that $d_{B} \in {1, 2}$ each with probability 1/2. In both cases, at the redispatch stage, demand for upward and downward redispatch is known. Therefore, the redispatch bidding functions of the basic model (3) and (4) apply when one unit of redispatch is required, and bidding functions of the case $d_{B} = 3$ (see (11) and (12)) apply when there is demand for two units of redispatch.

In the spot market, if demand is stochastic with $d_{B} \in {2, 3}$ and $n_{A} > 3$ , generators in $A$ choose bids that lie in-between those in the cases $d_{B} = 2$ and $d_{B} = 3$ (see Figure A.1). Generators with low costs bid more closely to the case $d_{B} = 2$ whereas those with high costs bid more closely to the case $d_{B} = 3$ . As $n_{A}$ increases, the bidding function converges to that of case $d_{B} = 3$ . Generators in $B$ bid such that they do not win in the spot market. Depending on the realized demand, there is one or two units of redispatch. Expected payoffs of generators in $A$ are as in the cases $d_{B} \in {2, 3}$ , which are equal.

Similarly, if demand is stochastic with $d_{B} \in {1, 2}$ and $n_{A}$ is sufficiently high, generators in $A$ choose bids that lie in between those in the cases $d_{B} = 1$ and $d_{B} = 2$ and generators in $B$ bid such that they do not win in the spot market. Depending on realized demand, there is either no or one unit of redispatch.

The analysis reveals that uncertainty about congestion does not necessarily reduce the occurrence of strategic behavior. A reduction in the probability of a binding transmission constraint is ineffective if it is not strong enough (a reduction by 50% in our model is ineffective) and may have unintended consequences (it may prevent the existence of pure-strategy equilibria).

5. Impact of Market Design

In this section, we analyze regulatory changes to the market design that have been brought forward as a means to mitigate inc-dec gaming: a single bid for spot and redispatch markets, price caps, and uniform pricing in the redispatch market (ENTSO-E 2021).¹⁹ We expand our model accordingly and provide formal derivations of the results in Appendix A.3. In addition, we qualitatively discuss a hybrid model combining market-based and cost-based redispatch.

5.1. Single Bid for Spot and Redispatch Market

This change relates to the argument that the possibility to adjust the bid in the spot market for the redispatch market is problematic. The rationale is that if generators could not adjust their bid, they would be unable to engage in gaming. To assess this claim, we extend the basic model accordingly: We allow only one bid per provider that is used both in the spot market and, if relevant, the respective redispatch market.

With only one bid and $k = 1$ , equilibrium payoffs and final allocation are identical as in the basic model in Section 3.1. Intuitively, the bidding functions (3) and (4) form an equilibrium because bidding according to these functions both in the spot and the redispatch market is according to Proposition 1 an equilibrium even if the generators are allowed to submit different bids on the two markets. Thus, this restriction of generators’ bids is inconsequential.²⁰ The same holds in the case of full information, as has been shown by Holmberg and Lazarczyk (2015).²¹

However, such invariance of bidding functions when only one bid is feasible does not hold in general. As shown in Section 3.1, $β_{A}^{S} (x) < β_{A}^{R} (x)$ for $k \geq 2$ , and, thus, bidding functions differ. In Appendix A.3.4, we exemplarily show for $k = 2$ the equilibrium bidding function in $A$ for the single-bid case. We also have $β_{A}^{S} (x) < β_{A}^{R} (x)$ in the case $k = 1$ and $d_{B} = 3$ (see (9) and (11)).

Therefore, for these cases, the expected spot market price and the expected redispatch payments with only one bid are different from those in the corresponding case of the basic model. However, the final allocation is identical to that of the basic model, and in both $A$ and $B$ the expected payoff of the weakest provider with $x = 1$ is zero. If these two conditions are met, overall payoff equivalence applies (e.g., Krishna 2010, propositions 3.1 and 5.2).

Accordingly, the one-shot game with a single bid for both markets has no advantage over the approach with two bids.

5.2. Price Caps

Price caps in spot and redispatch markets are proposed to restrict profits from gaming and thus make it less attractive (Klempp et al. 2020). In the basic model, we assume price caps that do not undercut the variable costs of the most expensive generator, that is, the cap is set at $r \geq 1$ . The outcome is the same for all these price caps. The only supply reduction due to bids above costs is by generators with low costs in market $B$ (as those with costs below $E [X_{(k, 2 k - 1)}]$ bid this amount or more), so overly high bids are not at the core of the problem.

Furthermore, a price cap in the spot market changes the outcome only if it is below the expected median costs, $r < E [X_{(k, 2 k - 1)}]$ . Such a restrictive price cap in the spot market as well as price caps $r < 1$ in the redispatch market in $B$ may prevent a feasible allocation (matching supply and demand) and thus have a negative effect on efficiency.

Price caps are hence not an adequate mitigation option for inc-dec gaming because gaming relies on bids in the range of the variable generation costs to take advantage of arbitrage opportunities.

5.3. Uniform Pricing in the Redispatch Market

The basic model assumes pay-as-bid pricing in the redispatch markets, as it is usually applied in practice. However, changing the price rule in the redispatch markets to uniform pricing yields the same results. Under uniform pricing, the highest rejected bid determines the price in the auction for downward redispatch and the lowest rejected bid determines the price in the auction for upward redispatch. In this setting, it is weakly dominant for generators to bid their costs at their redispatch market, $β_{A}^{R} (x) = x$ and $β_{B}^{R} (x) = x$ . With these bidding functions, generators’ expected payments and winning probabilities in the redispatch stage are the same as in the basic model. Therefore, they bid in the spot market as in the basic model, that is, as in (1) and (2). As a result, the expected payoffs for all generators and the dispatch are the same under uniform pricing as under pay-as-bid pricing.²²

5.4. Hybrid Model

Another suggestion to avoid inc-dec gaming is a hybrid redispatch model: a combination of cost-based redispatch for generation units and market-based redispatch for all other flexibility units. This approach would integrate all redispatch potentials in one joint merit-order. Market-based bids are used only if they are cheaper than their regulated cost-based counterparts (Cramton 2019). To our knowledge, a hybrid approach as discussed in this subsection has not been implemented in practice as of 2023. In the following, we illustrate a case where the hybrid approach reduces the incentives for inc-dec gaming and its effects.

For the analysis of a hybrid model, we consider the basic model in Section 3.1 and assume that the costs of all $2 k$ generators in $B$ are known. On this basis, we assume cost-based redispatch for the generation units in $B$ and market-based redispatch for the units in $A$ . Because the profit of generators in $B$ in the second stage is zero regardless of whether they are upward redispatched or not, it is optimal for them to bid their costs in the spot market with uniform pricing. Compared to the basic model, this increases competition for the $n_{A}$ generators from $A$ in the spot market and may result in no need for redispatch. The latter happens when $k$ or more generators from $B$ win in the spot market. This reduces the probability of a provider from $A$ to make a profit with redispatch compared to the basic model where redispatch always occurs. This also reduces the effect of expected redispatch profits on the spot market bid of generators from $A$ , and thus reduces the extent of inc-dec gaming in the form of a strategic deviation from bidding the costs in the spot market.

In conclusion, the example shows that the hybrid model reduces the incentives for inc-dec gaming compared to market-based redispatch.

6. Conclusion

We propose a game-theoretic model to study strategic behavior in redispatch markets. Our model comprises a setting with two interconnected regions within one pricing zone. We extend existing models by considering incomplete information about competitors’ costs and a finite set of generators. We identify an equilibrium in which the final dispatch is inefficient due to the strategic behavior of inc-dec gaming. According to our analysis, market-based redispatch leads to inefficient outcomes and high redispatch payments. The sources and extent of inefficiency and high payments are identified by comparing market-based redispatch with different theoretical benchmarks. Moreover, we study multiple variations of our basic model to assess whether inc-dec gaming incentives occur only in markets with specific characteristics. Our assessment reveals that inc-dec gaming is also a rational behavior in markets with high competition and with uncertainty about congestion. Finally, we examine whether market design changes can mitigate inc-dec gaming. The analyzed market design changes comprise single bids for spot and redispatch markets, price caps, uniform pricing in the redispatch markets, and a hybrid model. None of these market design changes prevents inc-dec gaming entirely.

Our analysis is well suited to identifying and attributing the problems of market-based redispatch. However, the model has some limitations, and the analysis can be extended in future research in several ways. First, the chosen setting may seem restrictive with respect to the number of generators in $B$ , demand, and transmission capacity. Varying these assumptions can provide additional insights. The same holds for an extension to more than two regions, meshed networks, and multi-unit generators. Besides, an attempt could be made to determine and compare other equilibria of the redispatch game. Another possible extension is the comparison of market-based redispatch and cost-based redispatch in one model framework. The model is also not suited for an analysis of alternative mitigation options in the design of redispatch markets, such as a capacity-based compensation with long-term contracts. Adjusting the model accordingly may be an interesting avenue for further research.

Footnotes

A. Appendix

ORCID iDs

Karl-Martin Ehrhart

Ingmar Schlecht

Funding

The authors disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research received funding by the German Federal Ministry for Economic Affairs and Climate Action in the project “ $unIT - e^{2}$ – Reallabor für verNETZte E-Mobilität” [funding code: 01MV21UN17].

Declaration of Conflicting Interests

The authors declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

1

The European Regulation 2019/943 on the internal market for electricity defines the term redispatch as both generation and consumption control measures for congestion management ().

2

The outcome is the same whether there is one bid per market stage or a single bid for both stages.

3

To determine an adequate compensation for these assets, system operators would need to estimate each consumer’s opportunity costs, that is, their willingness to pay for electricity.

4

The regulation states that redispatch must be organized via a competitive mechanism, unless one of the following exemptions apply: no market-based alternative is available, all available market-based resources are exhausted, the number of available units is too low to ensure effective competition, or the current grid situation leads to congestion in such a frequent and predictable way that market-based redispatch would result in strategic bidding.

5

We vary demand (relative to $k$ ) and certainty of demand in sections 4.2 and 4.3. The case $n_{A} = 2 k$ is analyzed separately in Section 4.1.

6

Notation: $X_{(1, n)} \leq X_{(2, n)} \leq \dots \leq X_{(n, n)}$ , that is, the first order statistic $X_{(1, n)}$ is the smallest, $X_{(1, n)} = \min {X_{1}, X_{2}, \dots, X_{n}}$ ().

7

This assumption can be justified by real-world network characteristics in which congestion usually occurs in the same direction (until the network may finally be enforced) or by predictability of the direction of a congestion for specific market time units.

8

In Section 5.3, we will show that uniform pricing leads to the same outcome.

9

As is common in auction theory analysis, we concentrate on symmetric equilibria in pure and increasing strategies (e.g., ). That is, all generators in $A$ use the same increasing bidding function $β_{A}$ , and all generators in $B$ use the same increasing bidding function $β_{B}$ . An exception is $β_{B}^{S}$ , which is symmetric, but not necessarily increasing, since any bid in the interval $[E [X_{(k, 2 k - 1)}], r]$ can be chosen.

10

The off-the-equilibrium-path parts of the equilibrium bidding strategies, which are complete bidding plans for each type and each contingency, are described in .

11

The order statistic $X_{(k, 2 k - 1)}$ is the random variable of the median of the sample of 2k− 1 independent draws from $F$ . Thus, the bids $β_{A}^{S} (x)$ , $β_{A}^{R} (x)$ , and $β_{B}^{R} (x)$ are equal to an expected value of the sample median conditional on $x$ .

12

This is an equilibrium: No single losing or winning bidder can cause congestion by unilaterally deviating, all winning bidders prefer winning to losing and cannot lower the price, and all losing bidders prefer losing to winning and cannot win at a lower price. Note that also in the opposed case of cost realizations where $k$ or less of the $2 k$ generators with the lowest costs are in $B$ , with complete information and a finite number of generators there are equilibria that resemble those of for atomistic generators. Assume for simplicity that all generators’ realized costs differ, and assume for equilibrium existence that ties are broken in favor of efficiency. There is an equilibrium in which all generators bid the same in the spot market as in the redispatch market. In $A$ , the generators with the $k$ - to ( $2 k + 1$ )-lowest costs in $A$ bid the $k$ -lowest costs in $A$ and all others in $A$ bid their costs. In $B$ , the generators with the lowest to ( $k + 1$ )-lowest costs bid the ( $k + 1$ )-lowest costs in $B$ and the others bid their costs. In the outcome, $2 k$ generators in $A$ win in the spot market, $k$ units are redispatched, the redispatch price in $A$ is equal to the spot market price whereas the redispatch price in $B$ is higher, and the final allocation is efficient as the $k$ generators in $A$ with the lowest costs deliver. There are further equilibria with the same outcome, and others with different allocation and/or prices. For example, the asymmetric Bayesian equilibria in Footnote 13 with arbitrary delivering generators and high spot market price are also equilibria in the case of complete information.

13

An example of an asymmetric equilibrium where generators in $A$ do not have a positive redispatch probability is given by $t_{A}$ generators in $A$ , $0 \leq t_{A} \leq k - 1$ , and $t_{B} = 2 k - t_{A}$ generators in $B$ bidding zero in the spot market, while all others bid one.

14

The VCG mechanism is the unique mechanism with these properties. Only fixed transfers added to the payments resulting from a VCG mechanism, would also not affect the incentives (Green and Laffont 1979; ).

15

In contrast to traditional locational marginal pricing, the VCG mechanism may set different local prices even if the transmission capacity is just sufficient. Therefore, generators cannot profit from inducing a congestion by misstating costs in the VCG mechanism.

16

With this approach, we follow Aumann (1964) and and consider the limit of a sequence of non-cooperative games with finite players while maintaining the structure of the game.

17

For $n_{A} = 3$ , the bidding functions in the redispatch markets are the same as for $n_{A} > 3$ . Bidding in the spot market assures that generators from $A$ win, but the spot price is determined by a bid from region $B$ .

18

The revenue equivalence theorem applies to comparing cases $d_{B} \in {2, 3}$ because in each case only the provider with the lowest costs generates and the worst-off provider type, the one with costs 1, has an expected payoff of zero.

19

For an extensive overview of mitigation measures see .

20

In contrast to $k \geq 2$ , market price information does not play a role in the equilibrium for $k = 1$ . This is due to the fact that in this case only two generators in $A$ compete in the redispatch stage. Since they assume in their bidding strategy (3) that the competitor’s costs are lower than their own, these are also lower than the spot market price, which thus has not an explicit effect. Therefore, (1) is equal to (3). The bidding functions (2) and (4) in $B$ are independent of the spot market price anyway.

21

Their equilibrium is outcome equivalent to our equilibrium as $k$ goes to infinity (see Section 4.1).

22

The payoff equivalence at the second stage and the overall payoff equivalence can also be derived using the payoff equivalence theorem (e.g., , propositions 3.1 and 5.2).

23

If $n_{A} = 3$ , analogous to the case $n_{A} = 2$ in , the bids in $B$ in the spot market determine the spot market price, which can take values up to $r$ . Thus, $β_{A}^{S} (x) \in [0, E [X_{(1, 2)}]]$ arbitrary. Note that the interval bounds can also be $[0, E [X]]$ and $[E [X], r]$ , as long as $β_{A}^{S} < β_{B}^{S}$ .

References

ACER and CEER. 2021. “Market Monitoring Report 2020 – Electricity Wholesale Markets Volume.”https://www.acer.europa.eu/electricity/market-monitoring-report.

Ahsanullah

Nevzorov

V. B.

Shakil

2013. An Introduction to Order Statistics. Atlantis Press. doi:10.2991/978-94-91216-83-1.

Alaywan

Papalexopoulos

2004. “Transitioning the California Market from a Zonal to a Nodal Framework: An Operational Perspective.”IEEE PES Power Systems Conference and Exposition 2: 862–67. doi:10.1109/PSCE.2004.1397468.

Aumann

R. J.

1964. “Markets with a Continuum of Traders.”Econometrica 32 (1/2): 39–50.

Brunekreeft

Neuhoff

Newbery

2005. “Electricity Transmission: An Overview of the Current Debate.”Utilities Policy 13 (2): 73–93. doi:10.1016/j.jup.2004.12.002.

Clarke

E. H.

1971. “Multipart Pricing of Public Goods.”Public Choice 11: 17–33.

Cramton

2019. “Local Flexibility Market.”https://www.cramton.umd.edu/papers2015-2019/cramton-local-flexibility-market.pdf.

Eicke

Schittekatte

2022. “Fighting the Wrong Battle? A Critical Assessment of Arguments against Nodal Electricity Prices in the European Debate.”Energy Policy 170: 113220. doi:10.1016/j.enpol.2022.113220.

ENTSO-E. 2021. “Options for the Design of European Electricity Markets in 2030.” Discussion Paper for Stakeholder Consultation, ENTSO-E.

10.

EU. 2019. “Regulation (EU) 2019/943 of the European Parliament and of the Council of 5 June 2019 on the Internal Market for Electricity.”European Union.

11.

Graf

Quaglia

Wolak

F. A.

2021. “Simplified Market Mechanisms for Non-Convex Markets: Evidence from Italian Electricity Market.”https://web.stanford.edu/group/fwolak/cgi-bin/sites/default/files/IncDecGame_Submission.pdf.

12.

Green

E. J.

1984. “Continuum and Finite-Player Noncooperative Models of Competition.”Econometrica 52 (4): 975–93.

13.

Green

Laffont

J.-J.

1979. Incentives in Public Decision Making. Amsterdam.

14.

Green

2003. “Cost Recovery and the Efficient Development of the Grid.” In Transport Pricing of Electricity Networks, edited by Lévêqe

Springer. doi:10.1007/978-1-4757-3756-1_5.

15.

Grimm

Martin

Sölch

Weibelzahl

Zöttl

2022. “Market-Based Redispatch May Result in Inefficient Dispatch.”The Energy Journal 43 (5): 205–230. doi:10.5547/01956574.43.5.csol.

16.

Groves

1973. “Incentives in Teams.”Econometrica 41 (4): 617–31.

17.

Hesamzadeh

M. R.

Biggar

D. R.

Rosellon

Hesamzadeh

2021. “Transmission Network Investment in a Time of Transition.”Economics of Energy & Environmental Policy 10 (2): 93–115. doi:10.5547/2160-5890.10.2.mhes.

18.

Hirth

Schlecht

2019. “Market-Based Redispatch in Zonal Electricity Markets: Inc-Dec Gaming as a Consequence of Inconsistent Power Market Design (not Market Power).”https://www.econstor.eu/handle/10419/194292.

19.

Holmberg

Lazarczyk

2015. “Comparison of Congestion Management Techniques: Nodal, Zonal and Discriminatory Pricing.”The Energy Journal 36 (2): 145–66 doi:10.5547/01956574.36.2.7.

20.

Holmstrom

1979. “Groves Schemes on Restricted Domains.”Econometrica 47: 1137–44.

21.

Joskow

P. L.

2008. “Lessons Learned from Electricity Market Liberalization.”The Energy Journal 29 (2): 9–42. doi:10.5547/ISSN0195-6574-EJ-Vol29-NoSI2-3.

22.

Klempp

Heilmann

Pelka

, et al. 2020. “Strategisches Gebotsverhalten im Kontext der C/sells FlexPlattform.” FfE Discussion Paper, Forschungsstelle für Energiewirtschaft.

23.

Klóters

Neumann

Hein

Moser

2022. “Monitoring and Mitigation of Market Manipulation in Redispatch Markets.”18th International Conference on the European Energy Market (EEM), Ljubljana, Slovenia. IEEE. doi:10.1109/EEM54602.2022.9921016.

24.

Konstantinidis

Strbac

2015. “Empirics of Intraday and Real-Time Markets in Europe: Great Britain.” Technical Report, DIW – Deutsches Institut für Wirtschaftsforschung.

25.

Krishna

2010. Auction Theory. 2nd ed. Academic Press.

26.

Sarfati

Hesamzadeh

M. R.

Holmberg

2019. “Production Efficiency of Nodal and Zonal Pricing in Imperfectly Competitive Electricity Markets.”Energy Strategy Reviews 24: 193–206. doi:10.1016/j.esr.2019.02.004.

27.

Sarfati

Holmberg

2020. “Simulation and Evaluation of Zonal Electricity Market Designs.”Electric Power Systems Research 185: 106372. doi:10.1016/j.tifr.2020.106372.

28.

Vickrey

1961. “Counterspeculation, Auctions, and Competitive Sealed Tenders.”The Journal of Finance 16 (1): 8–37.

Congestion Management Games in Electricity Markets

Abstract

Keywords

1. Introduction

2. Background: Markets for Redispatch

3. Strategic Behavior in Market-based Redispatch

3.1. Basic Model

3.2. Benchmarking Market-based Redispatch

4. Impact of Market Fundamentals

4.1. Competition and Market Size

4.2. Varying Cost-related Congestion

4.3. Uncertainty About Congestion

5. Impact of Market Design

5.1. Single Bid for Spot and Redispatch Market

5.2. Price Caps

5.3. Uniform Pricing in the Redispatch Market

5.4. Hybrid Model

6. Conclusion

Footnotes

A. Appendix

ORCID iDs

Funding

Declaration of Conflicting Interests

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

References