Smooth Quadratic Prediction Markets
Not on the map. Why?
Abstract (arXiv)
When agents trade in a Duality-based Cost Function prediction market, they collectively implement the learning algorithm Follow-The-Regularized-Leader. We ask whether other learning algorithms could be used to inspire the design of prediction markets. By decomposing and modifying the Duality-based Cost Function Market Maker's (DCFMM) pricing mechanism, we propose a new prediction market, called the Smooth Quadratic Prediction Market, the incentivizes agents to collectively implement general steepest gradient descent. Relative to the DCFMM, the Smooth Quadratic Prediction Market has a better worst-case monetary loss for AD securities while preserving axiom guarantees such as the existence of instantaneous price, information incorporation, expressiveness, no arbitrage, and a form of incentive compatibility. To motivate the application of the Smooth Quadratic Prediction Market, we independently examine agents' trading behavior under two realistic constraints: bounded budgets and buy-only securities. Finally, we provide an introductory analysis of an approach to facilitate adaptive liquidity using the Smooth Quadratic Prediction Market. Our results suggest future designs where the price update rule is separate from the fee structure, yet guarantees are preserved.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 22 references that are in the map. First posted on arXiv 5 May 2025.
Builds on
10 of 22 references.
References · 10
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 341
- 2023Handbook of Convergence Theorems for (Stochastic) Gradient Methodscited by 163
- 2017Cycles in adversarial regularized learningcited by 124
- 2017A Regularized Framework for Sparse and Structured Neural Attentioncited by 38
- 2013An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizationscited by 19
- 2014A continuous-time approach to online optimizationcited by 13
- 2021Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincar'e Recurrencecited by 3
- 2023An Axiomatic Characterization of CFMMs and Equivalence to Prediction Marketscited by 3
- 2017An Axiomatic Study of Scoring Rule Marketscited by 2
- 2015Budget Constraints in Prediction Marketscited by 1
Built on by
Not cited yet.