Algorithmic Bidding for Virtual Trading in Electricity Markets
This addresses the challenge of arbitrage in electricity markets for traders, though it is incremental as it builds on existing online learning methods.
The paper tackles the problem of optimal bidding for virtual trading in electricity markets by proposing an online learning algorithm that maximizes cumulative payoff and Sharpe ratio, showing it outperforms benchmarks and the S&P 500 index over a ten-year period.
We consider the problem of optimal bidding for virtual trading in two-settlement electricity markets. A virtual trader aims to arbitrage on the differences between day-ahead and real-time market prices; both prices, however, are random and unknown to market participants. An online learning algorithm is proposed to maximize the cumulative payoff over a finite number of trading sessions by allocating the trader's budget among his bids for K options in each session. It is shown that the proposed algorithm converges, with an almost optimal convergence rate, to the global optimal corresponding to the case when the underlying price distribution is known. The proposed algorithm is also generalized for trading strategies with a risk measure. By using both cumulative payoff and Sharpe ratio as performance metrics, evaluations were performed based on historical data spanning ten year period of NYISO and PJM markets. It was shown that the proposed strategy outperforms standard benchmarks and the S&P 500 index over the same period.