Basic Prerequisites: 01 - From Zero and basic probability (normal distributions, conditional variance, OLS).


1. Intuition & Practical Objective

Kyle (1985) asked the sharpest possible version of the informed-trader question. Instead of a two-point value and a one-shot trade, suppose:

  • the asset’s value is - a continuum of possible values, so the insider has how much better informed she is rather than which way;
  • a single strategic insider observes and chooses how much to trade;
  • noise traders submit - random volume whose only job is camouflage;
  • competitive market makers see only the total signed order flow and set a price.

The insider’s problem is a genuine strategic dilemma. Trade big and you move the price against yourself; trade small and you earn the impact-free edge on fewer shares. Kyle showed the equilibrium is startlingly clean: the insider submits a quantity linear in her edge, the makers use a linear price rule, and - the famous result - exactly half of the insider’s private information is impounded into the price, regardless of how much noise there is.

The second half of this page is the continuous-time question, and it contains the most useful trap in the literature. Everyone’s first instinct is: “run more and more auctions over a fixed horizon and take the limit”. That limit does not exist. Kyle’s multi-auction model releases information geometrically (half per auction), and if you shrink the interval between auctions while holding the total noise budget fixed, the first-period price impact blows up. The correct continuous-time object - derived by Back (1992) - has linear information release and a constant impact coefficient . Knowing which limit you are taking is the difference between a correct high-frequency model and nonsense.

The one-sentence essence. “A strategic insider trades proportionally to her edge, the makers price linearly, exactly half the private information gets revealed - and in continuous time the impact coefficient is constant and equal to , which you only get from Back’s linear-release equilibrium, not from a naive limit of the discrete game.”


2. Mathematical Ground Truth & Derivations

2.1 The single auction. , , insider demand , total flow , linear price . Makers are competitive, so they earn zero expected profit; by the projection theorem , which for jointly normal variables is

if the insider uses . The insider maximises ; the first-order condition gives , and solving the two equations together:

Substituting back, the residual variance is

Half the information, whatever the noise. And .

2.2 The -auction game. Repeat the auction times with equal noise variance per round and prior variance . Write , . Since ,

Each round the insider again faces , so and the recursion collapses to

so information is released geometrically - half per auction - and decays geometrically while grows geometrically. The insider’s total expected profit converges to a finite limit:

More auctions more profit, but bounded: versus the single auction’s .

2.3 Why the naive continuous-time limit is ill-posed. Fix a horizon , put auctions of length , and give each round the “correct” noise variance (proportional to the clock, so the total noise budget over is ). Then

The discrete game does not converge: shrinking the auction interval while the insider’s information advantage stays fixed makes the first period infinitesimally informative and hence infinitely costly to trade into. Something must give - and what gives, in the correctly posed model, is the shape of information release.

2.4 Back (1992): the correct continuous-time limit. Let and let the price be . The correct equilibrium satisfies with

The derivation is a one-line filtering identity, and it is worth internalising. If and the innovation representation is , then

because the predictable part of is known and only the noise contributes variance. With we have , so - is constant in , and equal to .

Two consequences worth memorising:

  • : all the information is released by . Half of it is released by - the continuous analogue of the auction’s .
  • : a longer horizon means a deeper market (more time for the noise to accumulate, so the flow-to-price map is flatter). This is the exact opposite of the trading-desk intuition “longer = more risk”, and both statements are true - they are about different objects (information per unit flow vs inventory risk).

3. Computational Implementation - the Kyle engine and the Back limit, verified

Stdlib only. Three verified blocks of work: (a) the discrete -auction recursion with its profit limit, (b) the divergence of the naive continuum, (c) Back’s continuous-time information accounting.

Three things to take away:

  1. halves every round () while doubles, because halves and the two are reciprocal square roots of the same quantity. This geometric pattern is the discrete model.
  2. The total profit saturates: already gives against the limit . The insider’s marginal auction is worth exponentially less.
  3. The naive continuum diverges linearly in ( at ), while Back’s continuous-time identity holds exactly - and the integral of information release equals to the last digit. The two “limits” are not the same limit, and only one of them exists.

4. Failure Modes & First-Principles Breakdowns

  1. Confusing the two limits. “Kyle’s continuous-time model” is Back’s (1992) linear-release equilibrium, not the limit of the discrete auction game. Anyone who calibrates a high-frequency impact parameter by “taking ” from the discrete recursion will get an impact coefficient that diverges.
  2. is not a physical constant. It is : it depends on the prior uncertainty, the noise volume, and the horizon. Double the noise volume and depth () rises by ; double the horizon and depth rises by . Impact estimates that ignore are not comparable across names.
  3. The half-information result is a knife-edge of normality. follows from joint normality. Under fat tails or a discrete value the “exactly half” property fails, and with it every argument that uses it as a calibration anchor.
  4. One strategic insider is not a market. With informed traders the revelation rate scales with and falls toward zero (page 06). A single-insider fit on a market with many informed participants systematically over-states impact.
  5. Noise is not a fixed budget. The model treats as exogenous and constant. In reality noise volume responds to realised volatility and to the presence of informed flow - the parameter you calibrated is a function of the thing you are modelling.
  6. The insider’s optimality is never tested. The model says the insider should trade ; it does not say anyone does. Empirically, informed flow is autocorrelated and clustered in time, which the one-shot Gaussian insider does not generate.

5. References

  • Kyle, Albert S. - “Continuous auctions and insider trading,” Econometrica 53(6), 1315–1335 (1985). Sections 1–3: the batch auction, , , the -auction recursion, and the insider’s profit.
  • Back, Kerry - “Insider trading in continuous time,” Review of Financial Studies 5(3), 387–409 (1992). *The rigorous continuous-time limit; the founding application of filtering to microstructure.
  • Holden, Craig W.; Subrahmanyam, Avanidhar - “Long-lived private information and imperfect competition,” Journal of Finance 47(1), 247–270 (1992). What happens with many informed traders; see page 06.
  • Kühn, Christoph; Lorenz, Christopher - “Insider trading in discrete time Kyle games,” Mathematics and Financial Economics 19, 39–66 (2025). Exactly the question this page turns on: which discrete games converge to the continuous-time Kyle–Back equilibrium (and which do not).
  • Hasbrouck, Joel - Empirical Market Microstructure (2007)
  • Grossman, Sanford J.; Stiglitz, Joseph E. - “On the impossibility of informationally efficient markets,” American Economic Review 70(3), 393–408 (1980). *Why some noise must exist for information to be worth acquiring
  • Kyle, Albert S.; Obizhaeva, Anna A. - “Market microstructure invariance,” Econometrica 84(3), 975–1024 (2016). What happens when you insist that obey dimensional invariance across assets.

6. Connected Graph Bridges