Papers, ranked by score

Ordered by a blend of empirical rigor (60%) and math complexity (40%).

Packets, Transactions and Queues: Design Principles for HFT Systems from a Measurement Study of CME Market Data

HFT systems are conventionally built as a single-threaded event loop, on the rule that every thread hop adds latency. We test that rule against a measurement study of more than a year of CME market data for the NQ front-month contract, following every packet and matching-engine transaction through t

Holy Grail Math 7.5 Rigor 9 ·  October 5, 2026

Adapting the Actor Model of Concurrency for High-Frequency Trading: Synchronous Message Delivery (fast_send) and a Tick-to-Book Latency Study

The actor model - state isolation, data-race freedom, and sequential single-message reasoning - has long been dismissed as unsuitable for high-frequency trading (HFT): actors seem to imply many threads, a mailbox per actor, and a heap-allocated message plus a context switch per interaction, overhead

Street Traders Math 4 Rigor 8 ·  October 5, 2026

Model-Free Passive Execution via Order-Level Shadowing

Automated execution algorithms are organized into schedule-based and liquidity-seeking families. This paper concerns the first, whose members – Time-Weighted Average Price (TWAP), Volume-Weighted Average Price (VWAP), Percentage of Volume (POV) and Implementation Shortfall – are all model-based: e

Street Traders Math 4 Rigor 8 ·  September 16, 2026

Browse

All authors · Research topics · Papers with code · Download the scored dataset

📬 The Quant Space Weekly

One email a week: the most interesting quant finance papers, scored and summarized. No spam, unsubscribe anytime.