Paper: arXiv 2311.10738

Authors: Andres M. Alonso, Zehang Li

Abstract

In this note, we illustrate the computation of the approximation of the supply curves using a one-step basis. We derive the expression for the L2 approximation and propose a procedure for the selection of nodes of the approximation. We illustrate the use of this approach with three large sets of bid curves from European electricity markets.

Complexity vs Empirical Score

  • Math Complexity: 7.5/10
  • Empirical Rigor: 6.0/10
  • Quadrant: Holy Grail — high math complexity, high empirical rigor

Why this score: The paper presents a rigorous mathematical derivation of the L2 approximation for supply curves using specific basis functions and provides explicit solutions, indicating high mathematical complexity. It also includes empirical validation on real European electricity market data with detailed procedures for node selection and performance evaluation, demonstrating significant data and implementation focus.

Research Flowchart

  flowchart TD
  A["Research Goal: Approximate Supply Curves<br>using a One-Step Basis"] --> B{"Data: 3 Sets of European<br>Electricity Market Bid Curves"}
  
  B --> C["Methodology: Derive L2<br>Approximation Expression"]
  
  C --> D["Computational Process: Selection<br>of Approximation Nodes"]
  
  D --> E{"Computation: Apply<br>L2 Approximation"}
  
  E --> F["Key Outcomes"]
  
  F --> G["Explicit Expression<br>for L2 Approximation"]
  F --> H["Procedure for<br>Node Selection"]
  F --> I["Validated with<br>Real Market Data"]

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper proposes a simple and parsimonious approximation procedure for large sets of supply curves using a one‑step basis and explicit formulas.

Source sentence
In this note we propose a simple and parsimonious approximation procedure to a large set of supply curves.

Assumes 5

  • The set of price nodes {p_i} is given and fixed. model
    Source sentence
    For simplicity, we assume that the set {pi}n i=1 is given, but it is an interesting problem to optimize the grid.
  • The weight function W(p) is non‑negative and vanishes as p → +∞ to ensure integral convergence. statistical
    Source sentence
    W(p) is a non-negative weight function such that limp→+∞W(p) = 0. This condition is needed to guarantee the convergence of the integral (3).
  • Coefficients c_i are non‑negative, leading to a non‑decreasing sequence of c*_i. model
    Source sentence
    Since the coefficients {ci} are non-negative, then the coefficients {c∗ i } is a non-decreasing sequence.
  • The sample is split into a training set and a testing set for node selection. data
    Source sentence
    We divide our sample into a training set, C1 = {C1, C22, . . . , CT1} and a testing set C2 = {CT1, CT1+1, . . . , CT}.
Show 1 more
  • A finer grid (more nodes) yields a better approximation but reduces parsimony. model
    Source sentence
    It is clear that the quality of the approximation depends on the selected set of nodes, {pi}n i=1. It is expected that a finer grid will lead to a better approximation. However, increasing the number of nodes increases the dimension of the representation.

Data

  • Spanish secondary electricity market bids order-book public
    2016–2020
    Source sentence
    In this section, we compare the performance of the approximation procedure using the data from the Spanish secondary electricity market in the period 2016 – 2020.

Costs

Not applicable The paper reports no trading or execution result.

Finds 4

  • The mean scaled approximation error (MScApE) using naive predictions is 5.9593×10⁻³, markedly larger than the error achieved with the proposed procedure. performance
    Source sentence
    The mean scaled approximation error (MScApE) using the naive predictions was 5.9593×10−3 which is remarkable bigger than the approximation error when we used the proposed procedure.
  • From 10 nodes onward, the conditional‑distribution node selection slightly outperforms the marginal‑distribution approach. performance
    Source sentence
    The results show that, from 10 nodes, the procedure that uses the conditional distribution is slightly superior to the procedure that uses the marginal distribution of prices.
  • The proposed method reduces the number of nodes needed to represent a large set of supply curves while maintaining low approximation error. performance
    Source sentence
    An advantage of the proposed method is that it considerably reduces the number of nodes needed to represent a large set of supply curves.
  • Explicit formulas make the computational cost of the approximation lower than uniform‑grid or naive methods. performance
    Source sentence
    Another relevant advantage is that obtaining the approximation is achieved through explicit formulas, which makes the computational cost lower.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 27 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.