{"paper_id":"2409.06514","title":"Limit Order Book Simulation and Trade Evaluation with $K$-Nearest-Neighbor Resampling","authors":["Michael Giegrich","Roel Oomen","Christoph Reisinger"],"paper_date":"2024-09-10","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2409.06514v1","page_url":"https://thequant.space/flowcharts/limit-order-book-simulation-and-trade-evaluation-with-k-ne/","scores":{"empirical_rigor":8,"math_complexity":7.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a K‑NN resampling framework for simulating limit order books and evaluating trading strategies, including calibration of limit order sizes in a pro‑rata matching LOB.","quote":"We provide a framework how K-NN resampling can be adapted for simulating LOBs and how to incorporate trades within these simulations.","summary":"In this paper, we show how K-nearest neighbor (K-NN) resampling, an off-policy evaluation method proposed in \\cite{“giegrich2023k”}, can be applied to simulate limit order book (LOB) markets and how it can be used to evaluate and calibrate trading strategies. Using historical LOB data, we…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The LOB evolves as a discrete random dynamical system with transitions defined by functions fZ and fp.","type":"model","stated":"explicit","quote":"In particular, we assume that the LOB evolves as a discrete random dynamical system transitioning from one LOB state-price pair (Zt, p∗t) to the next, (Zt+∆t, p∗t+∆t), where ∆t ∈R>0 is the time increment and Zt the state representation for the LOB."},{"assumption":"The system noise ε is i.i.d., implying a Markovian LOB dynamics.","type":"model","stated":"explicit","quote":"We assume that the noise is identically and independently distributed (iid) for all s ∈N"},{"assumption":"Price level does not impact the shape of the subsequent order book.","type":"model","stated":"explicit","quote":"We choose to model the price explicitly in order to facilitate the assignment of empty tick sizes in the LOB snapshots and we assume that the price level does not have an impact on the shape of the subsequent order book."},{"assumption":"The LOB state is given by centered LOB snapshots for simplicity.","type":"model","stated":"explicit","quote":"For simplicity, we assume that the LOB state is given by centered LOB snapshots."},{"assumption":"Nearest‑neighbor parameter K is set heuristically to 20.","type":"model","stated":"explicit","quote":"In our experiments, we choose the nearest neighbor parameter K = 20 heuristically, which is common practice in machine learning."},{"assumption":"Euclidean distance is used as the metric for nearest‑neighbor search.","type":"model","stated":"explicit","quote":"As metric for the nearest neighbor search, we use Euclidean distances to keep the implementation as simple as possible."}]},"datasets":{"status":"available","items":[{"name":"historical LOB data","provider":null,"kind":"order-book","access":"unknown","period":null,"universe":null,"quote":"Using historical LOB data, we demonstrate that our simulation method is capable of recreating realistic LOB dynamics"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"l2-book"},"transaction_costs":{"status":"available","modeled":"yes","headline_net_of_costs":null,"detail":"Execution costs are measured via average cash earnings per asset, showing negative earnings (cost) around half a tick size, varying with order multiplier.","quote":"First, note that for all order multipliers the relative average cash earnings are negative, implying a cost of execution on average. The scale of the execution costs varies around half a tick size.","source":"evidence_card","rule":"R2","candidates":{"front_matter":"unclear","evidence_card":"yes","evidence_card_quoted":true},"card_detail":"Execution costs are measured via average cash earnings per asset, showing negative earnings (cost) around half a tick size, varying with order multiplier.","card_quote":"First, note that for all order multipliers the relative average cash earnings are negative, implying a cost of execution on average. The scale of the execution costs varies around half a tick size.","meaning":"costs are part of the reported headline results"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"Algorithm KNNR consistently outperforms deep‑learning and naive benchmarks on KS statistics for most LOB variables, especially return‑related features.","kind":"performance","quote":"Table 1 shows that Algorithm KNNR consistently outperforms our benchmarks for most variables. In particular, we highlight that all features related to returns outperform both the CGAN and the naive benchmark."},{"finding":"Synthetic trading in the simulation produces market impact consistent with literature, with execution costs around half a tick and optimal order multiplier k=1.25.","kind":"performance","quote":"Highest earnings (or lowest execution costs) are reached at k = 1.25, while they decrease consistently for smaller and larger values in k."},{"finding":"The K‑NN resampling method can realistically simulate LOB dynamics both with and without trade interventions.","kind":"statistical","quote":"We provide empirical evidence that our method is capable of realistically simulating LOB dynamics with and without trade interventions."}],"reported_performance":null,"out_of_sample":{"method":"holdout","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":18,"citations":{"cited_by_in_corpus":1,"by_independent_authors":1,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":1},"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:02:39Z"},"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/"}