Tick Size and Discrete Control in Prediction Markets
quantmarket-makingmath
Prediction-market prices lie in a bounded interval,
p∈[0,1],
with integer inventory and discrete tick size Δ.
For markets such as Kalshi, Δ is commonly 0.01 and can be as small as 0.001. Since the full price range has width 1, the exchange grid is not always negligible relative to the price adjustments produced by a continuous market-making model.
A live prediction-market order book. Every resting quote sits on a discrete cent grid, so the executable prices are exactly the admissible set PΔ we work with below.
Start with the Avellaneda-Stoikov reservation price
r(q,t)=St−qγσ2(T−t),
where q∈Z is inventory. Define
νt=γσ2(T−t).
Then
r(q+1,t)−r(q,t)=−νt.
Thus νt is the change in reservation price induced by one unit of inventory.
On the exchange, admissible prices are
PΔ={0,Δ,2Δ,…,1}.
Define nearest-tick quantization
QΔ(x)=Δround(Δx),
and the executable reservation price
r(q,t)=Π[0,1](QΔ(r(q,t))),
where Π[0,1] clips the price to the prediction-market domain.
Away from the boundaries,
∣QΔ(r)−r∣≤2Δ.
The relevant dimensionless ratio is
ρt=νtΔ=γσ2(T−t)Δ.
If
ρt≪1,
then one inventory change moves the reservation price through several ticks.
If
ρt≈1,
then one inventory change moves the reservation price by roughly one tick.
If
ρt≫1,
then several inventory changes can occur before the executable reservation price changes.
For example, let
St=0.50,νt=0.002,Δ=0.01.
Then
ρt=0.0020.01=5.
The continuous reservation prices are
0.500,0.498,0.496,0.494,0.492,0.490,…
while the exchange only admits
0.50,0.49,0.48,…
After quantization, several distinct inventory states can therefore map to the same price.
For νt<Δ,
r(q+1,t)−r(q,t)∈{0,−Δ},
away from the 0 and 1 boundaries.
The continuous model instead gives
r(q+1,t)−r(q,t)=−νt.
Tick transitions occur when
St−qνt=(k+21)Δ.
Solving for the corresponding inventory levels,
qk=νtSt−(k+21)Δ.
Therefore consecutive transitions satisfy
∣qk+1−qk∣=νtΔ=ρt.
Hence
ρt=inventory spacing between consecutive tick transitions.
For ρt=5, consecutive price changes are separated by approximately five units of inventory.
The bounded price interval adds another discretization effect. If
r(q,t)≤0,
then
r(q,t)=0,
and if
r(q,t)≥1,
then
r(q,t)=1.
Thus the executable policy is piecewise constant both because of tick quantization inside (0,1) and because of saturation at the boundaries.
The same issue appears in quote optimization.
Suppose the continuous model produces a local objective H(p). The continuous problem is
p∗=argp∈[0,1]maxH(p).
The exchange problem is
pΔ∗=argp∈PΔmaxH(p).
For Δ=0.01,
∣PΔ∣=101,
while for Δ=0.001,
∣PΔ∣=1001.
If H is twice differentiable near an interior maximizer p∗ and
∣H′′(p)∣≤M,
then the nearest admissible grid point pΔ satisfies
∣pΔ−p∗∣≤2Δ.
Since
H′(p∗)=0,
Taylor expansion gives
H(p∗)−H(pΔ)≤8MΔ2.
Because pΔ∗ is the optimal point on the grid,
0≤H(p∗)−H(pΔ∗)≤8MΔ2.
Therefore
H(pΔ∗)→H(p∗)
as
Δ→0.
The continuous optimization is recovered as the fine-grid limit of the discrete problem.
For the inventory adjustment, this limit corresponds to
γσ2(T−t)Δ→0.
At finite tick size, the natural control problem instead has discrete prices and integer inventory. With state
s=(p,q),
and actions
a∈PΔ,
the value function can be written in Bellman form as
When ρt≪1, the discrete grid approximates the continuous inventory adjustment.
When ρt≳1, multiple inventory states map to the same admissible price and the discrete control problem differs locally from its continuous approximation.