Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.00173

Price Discovery at the Boundary of Contractual Decidability: Terminal-Value Gaps, Trading Availability, and Venue Finality on Kalshi

Maksym Nechepurenko
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper studies price discovery around contractual decidability rather than an arbitrary venue label. Its upstream lifecycle and decidability clocks are specified in Papers 7.1 and 7.3. Historical venue endpoints remain useful background: 152,694 ordinary markets form the retrospective feasibility denominator, 71,657 have an exact public endpoint, and 70,979 have an exact determination-to-endpoint pair. Those fields do not supply a contractual-decidability clock. The completed historical recovery produced no historically admissible contractual-decidability cohort. The prospective infrastructure shakedown has passed and evidence enrollment is active, but production price extraction has not started. The primary binary cohort will be drawn from the prospectively enrolled and blind-adjudicated contractual-decidability frame, with an accepted exact or interval first-decidability clock, exact terminal payoff, trading-availability classification, and admissible bounded non-block trade or real-candle coverage. Markets tradable after decidability enter a reaction cohort; markets closed before decidability enter a stale-terminal cohort. Closure is a competing event for convergence, not ordinary missingness. A 20-market price pilot may validate acquisition, block-trade treatment, synthetic-candle rejection, staleness, and clock alignment only after blind packet lock and only from accepted prospective clock candidates. It does not create price estimates. The paper specifies a prospective primary cohort and a targeted pilot protocol. Price estimation awaits independently reconstructed first/stable-decidability clocks and source-release clusters. No broad exchange-wide trade crawl or post hoc clock substitution is permitted.

Explore related subjects

q-fin.TR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maksym Nechepurenko. 2026-09-16. Price Discovery at the Boundary of Contractual Decidability: Terminal-Value Gaps, Trading Availability, and Venue Finality on Kalshi. https://doi.org/10.2139/ssrn.7421318

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MLP-Initialized Reinforcement Learning for Exit Timing in SPX Short-Straddle Portfolios

This paper studies exit timing for SPX short-straddle portfolios using a two-stage supervised and reinforcement-learning framework. Historical episodes first generate ex-post optimal hold/exit labels for training a multilayer perceptron (MLP) using only contemporaneously available state variables at deployment. The trained MLP then initializes reinforcement-learning actors that are fine-tuned with a risk-aware trading reward. Out-of-sample evaluation over 2024-2026 shows that the supervised MLP substantially outperforms passive holding and representative fixed-time and profit-and-loss-based exit rules. Across seven independent seeds, MLP-initialized Actor-Critic averages 37.54% cumulative return and a Sharpe ratio of 1.705, compared with 35.01% and 1.651 for the supervised MLP. Actor-Critic trained from scratch averages only 0.18% return. These findings show that oracle-guided supervised learning provides a stable foundation for reward-based policy fine-tuning in a sparse and path-dependent option-exit problem.

q-fin.TR↗
arXiv2026

Deep reinforcement learning for optimal trading with partial information

Reinforcement Learning (RL) has attracted increasing interest in financial applications, including optimal trading and execution. However, the use of RL for optimal trading strategies that exploit latent information in the market has been, to the best of our knowledge, subject to little attention. In this paper, we consider an optimal trading problem in which the trading signal follows an Ornstein-Uhlenbeck process with regime switching parameters. The problem is naturally formulated as a partially observable Markov decision problem, requiring a trader to infer latent information directly from the history of the observable process. We combine recurrent neural networks (RNN) with RL to address both the filtering and trading components of the problem. More specifically, we propose three distinct RL-based approaches, on top of which we incorporate RNN to filter the latent state of the environment where the agent is trading. The first, a one-step approach, directly encodes hidden states from the GRU into the RL trader. The second and third are two-step methods: one that uses posterior regime probability estimates for the mean reverting regimes, while the other relies on forecasts of the next signal value. Through extensive simulations with increasingly complex Markovian regime dynamics for the trading signal's parameters, as well as an empirical application to equity pairs trading, we find that feeding posterior probability estimates on the latent long-run mean reversion regime achieves superior cumulative rewards and exhibits more interpretable strategies, in contrast with the other two approaches. Overall, our results show that the quality and structure of the information supplied to the agent are important for trading performance and policy interpretability.

q-fin.TR↗
arXiv2026

RED-2400: A Public Benchmark of Algorithmically-Rejected Trading Events with Outcome Labels

RED-2400 is a public benchmark of 6,660 algorithmically-rejected trading events from a live Solana decentralised-exchange filter stack, observed continuously over 22 calendar days (2026-04-10T21:10Z through 2026-05-02T21:48Z, UTC). Of the 6,660 rejection events, 3,333 (50.05 percent) link exactly to a post-rejection price-and-liquidity sample series. The deposit contains 169,123 forward-outcome observations and 1,837 graveyard-tracker lifecycle snapshots, covering 1,076 distinct mints in the rejection registry and 1,075 in the forward-observation file. The deposit contains no outcome-label column. In its lifecycle-tracker file, gone is a tracker state recorded with liquidity 0; it is not terminal (167 of the 377 mints that reach it later return to an alive state) and does not denote token death or a rug pull. Filter labels are anonymised to filter_1 through filter_8; source-collector identifiers to source_a and source_b. Liquidity and 24-hour volume are quantised to the nearest power of two, preserving heavy-tailed shape while preventing operational-threshold inference. This is the first window of a planned series; subsequent windows will extend the time horizon and enable regime-stratified analysis. "RED-2400" is a brand name, not a count; current cohort sizes are listed below and do not equal 2,400. Correction (October 2026): I withdraw Section V, which compared how often "early-death" and other rejected mints reach gone; 1,235 of the 1,236 early-death events were followed within 10.5 minutes by a re-rejection of the same token, so the label marks re-rejection timing, not token death. See the correction notice on page 1.

q-fin.TR↗