CORTEXA
← Browse
arxivcs.AIcs.CEcs.GT2026-07-07

When do prophets profit in prediction markets?

Anri Gu, Nicole Kagan, Alec Sun, Jibang Wu, Haifeng Xu

Prediction markets aggregate dispersed beliefs into prices that act as probabilistic forecasts of uncertain events. Classical theory establishes a clean equivalence between forecasting accuracy and trading profit, but only for the specific automated market maker (AMM) design. However, the largest exchanges today are based on central limit order books in which informed forecasters routinely lose money while uninformed strategies can profit on simple heuristics. We resolve this discrepancy by establishing a formal equivalence between predictive accuracy and profitability. For any strictly proper scoring rule $S$, we exhibit a "proper" betting strategy that depends only on the forecaster's prediction $\mathbf{p}$ and the market price $\mathbf{q}$, and earns positive expected profit whenever $\mathbf{p}$ outperforms $\mathbf{q}$ under $S$ and the market has sufficient liquidity. Moreover, this proper betting is essentially the only strategy with such robust profitability guarantee. The proof rests on a decomposition of expected profit that strictly generalizes the classical AMM guarantee and also explains how strategies can profit without an accuracy edge. Empirically, across thousands of forecasts by AI models, proper betting is the only strategy that reliably converts accuracy into profit, and we further identify systematic forecasting personas and show how the optimal proper strategy varies across them. A month-long live deployment on Kalshi achieves $+80.33\%$ return on investment with a Sharpe ratio of $3.35$.

View free PDFSource page

Related papers

arxivcs.AIcs.CE2026-06-30

CSTrader: A Testbed for Language-Grounded Trading in a Community-Driven Virtual Asset Market

Yao Shi, Kingfung Luo, Nan Tang, Yuyu Luo

Niche asset markets, such as Counter-Strike 2 (CS2) weapon skins, are small, volatile, and heavily driven by community discussions and platform rules. These properties make them hard for traditional quantitative models, but provide an ideal testbed for studying how large language…

View free PDFSource page
arxivmath.NAcs.AIcs.CEcs.LG2026-07-15

Spectral-Informed Neural Networks Outperform Spectral Methods in High-dimensional PDEs

Tianchi Yu, Ivan Oseledets

For low-dimensional problems ($d\leq3$), spectral methods can achieve exceptionally high accuracy. For middle-dimensional problems ($4 \leq d \lesssim 10$), spectral methods remain feasible through specific techniques such as sparse grids or hyperbolic cross. However, for high-di…

View free PDFSource page
arxivcs.CEcs.AImath.NA2026-07-15

Accounting for Hysteresis and Eddy Currents in Finite Element Simulations of Ferromagnetic Laminated Cores using a Recurrent Neural Network

Florent Purnode, Louis Denis, François Henrotte, Gilles Louppe, Christophe Geuzaine

Incorporating hysteresis and eddy currents into finite element simulations of laminated-core electrical machines is computationally challenging. Resolving the fields inside the laminations at each integration point and at every nonlinear iteration leads to computational costs sev…

View free PDFSource page
arxivcs.AIcs.GTcs.LGcs.MA2026-07-20

The Curvature Shadow: An Apparent Failure of Maximum-Entropy Equilibrium Selection is a Removable Artifact

Luis Leal

In two-player zero-sum games whose Nash equilibria form a convex set, regularized solvers such as Regularized Nash Dynamics (R-NaD) empirically select the maximum-entropy member: the information projection (I-projection) of a uniform reference onto the Nash set. On a panel of sma…

View free PDFSource page
arxivcs.SIcs.AIcs.GTcs.MA2026-07-15

The Dynamic Verifiable Multi-Agent Human Agentic Loyalty Loop (DVM-HALL) Model and the Net Human-Agent Score (NHAS) in Autonomous Commerce

Sai Srikanth Madugula, Peplluis Esteva de la Rosa, Daya Shankar

The rapid proliferation of Agentic Artificial Intelligence fundamentally disrupts traditional customer loyalty paradigms. As AI evolves from passive recommendation algorithms to autonomous, goal-directed agents capable of executing purchasing decisions, the conventional understan…

View free PDFSource page