Learning to Bid in FCR Markets: A Best-of-Both-Worlds Approach
Not on the map. Why?
Abstract (arXiv)
Bidding in the European Frequency Containment Reserve (FCR) market is challenging for flexibility providers because competing offers are hidden and bidders observe only partial feedback form the market, such as, clearing price and awarded quantity. For a participant active in a single country, we show that the multi-country FCR clearing problem can be recast as a repeated multi-unit uniform-price auction against an endogenous vector of opposing bids. This reformulation yields an online learning problem and allows us to adapt a Best-of-Both-Worlds combinatorial semi-bandit algorithm implementable from this standard market feedback. The resulting bidder achieves logarithmic pseudo-regret in stochastic environments and O(√T) regret in adversarial ones. Synthetic experiments confirm the expected scaling, and backtests on historical European FCR data show competitive performance in practice: the method performs especially well on stable products, while EXP3-type baselines can be safer under stronger non-stationarity. Overall, the results show that learning-based bidding in FCR markets is theoretically grounded and practically useful when the learning rule matches product-level market stability.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 24 references that are in the map. First posted on arXiv 29 May 2026.
Builds on
8 of 24 references.
References · 8
- 2018Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Banditscited by 124
- 2019Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneouslycited by 53
- 2015Online learning in repeated auctionscited by 39
- 2017Learning to Bid Without Knowing your Valuecited by 34
- 2019No-Regret Learning from Partially Observed Data in Repeated Auctionscited by 4
- 2024Learning to Bid in Forward Electricity Markets Using a No-Regret Algorithmcited by 3
- 2025Improved learning rates in multi-unit uniform price auctionscited by 2
- 2025Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimizationcited by 1
Built on by
Not cited yet.