{"paper_id":"2311.10738","title":"Approximation of supply curves","authors":["Andres M. Alonso","Zehang Li"],"paper_date":"2023-10-24","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2311.10738v1","page_url":"https://thequant.space/flowcharts/approximation-of-supply-curves/","scores":{"empirical_rigor":6,"math_complexity":7.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a simple and parsimonious approximation procedure for large sets of supply curves using a one‑step basis and explicit formulas.","quote":"In this note we propose a simple and parsimonious approximation procedure to a large set of supply curves.","summary":"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…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The set of price nodes {p_i} is given and fixed.","type":"model","stated":"explicit","quote":"For simplicity, we assume that the set {pi}n i=1 is given, but it is an interesting problem to optimize the grid."},{"assumption":"The weight function W(p) is non‑negative and vanishes as p → +∞ to ensure integral convergence.","type":"statistical","stated":"explicit","quote":"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)."},{"assumption":"Coefficients c_i are non‑negative, leading to a non‑decreasing sequence of c*_i.","type":"model","stated":"explicit","quote":"Since the coefficients {ci} are non-negative, then the coefficients {c∗ i } is a non-decreasing sequence."},{"assumption":"The sample is split into a training set and a testing set for node selection.","type":"data","stated":"explicit","quote":"We divide our sample into a training set, C1 = {C1, C22, . . . , CT1} and a testing set C2 = {CT1, CT1+1, . . . , CT}."},{"assumption":"A finer grid (more nodes) yields a better approximation but reduces parsimony.","type":"model","stated":"implied","quote":"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."}]},"datasets":{"status":"available","items":[{"name":"Spanish secondary electricity market bids","provider":null,"kind":"order-book","access":"public","period":"2016–2020","universe":null,"quote":"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."}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"The mean scaled approximation error (MScApE) using naive predictions is 5.9593×10⁻³, markedly larger than the error achieved with the proposed procedure.","kind":"performance","quote":"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."},{"finding":"From 10 nodes onward, the conditional‑distribution node selection slightly outperforms the marginal‑distribution approach.","kind":"performance","quote":"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."},{"finding":"The proposed method reduces the number of nodes needed to represent a large set of supply curves while maintaining low approximation error.","kind":"performance","quote":"An advantage of the proposed method is that it considerably reduces the number of nodes needed to represent a large set of supply curves."},{"finding":"Explicit formulas make the computational cost of the approximation lower than uniform‑grid or naive methods.","kind":"performance","quote":"Another relevant advantage is that obtaining the approximation is achieved through explicit formulas, which makes the computational cost lower."}],"reported_performance":null,"out_of_sample":{"method":"holdout","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":27,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T18:20:21Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}