Chapter 10 · begins on page 385
Aggregating Information
The models
Each model in the book is stated on one card: who decides, when, with what information and commitment, what they get, what they may do, and the question it answers.
Model F1 · p. 413
Which penalty functions make honesty optimal, and what do the others reward?
Model F2 · p. 414
What does the sponsor's money buy, and when does honesty survive strategic traders?
Model F3 · p. 416
What is lost by averaging probabilities instead of combining evidence?
Model F5 · p. 418
What does the subsidy buy, and how do insiders and outside stakes change what the price says?
Model F6 · p. 421
What do quotes, the price path and an audit reveal when some orders know the statement?
What is proved, in words
The book follows each result with one sentence that says what it means without symbols. The formal statement is a click away; the proofs are in the book.
Proposition 10.2 · Propriety is an identity; impropriety is a policy; Model F1 · p. 414
Under the quadratic score honesty is optimal by an identity; under absolute error a forecaster with a definite leaning is paid to round its belief to the nearer certainty.
Proposition 10.4 · Telescoping subsidy and myopic honesty; Model F2 · p. 415
In a market scoring rule each trader is paid for the improvement it makes, the sponsor's cost is bounded, and a trader who will not trade again does best by reporting its belief.
Proposition 10.7 · The price of averaging; Model F3 · p. 416
Averaging the probabilities of two experts with conditionally independent evidence wastes three eighths of what their combined evidence is worth here: agreeing moderate opinions should combine into a stronger one, not average into the same.
Proposition 10.10 · Murphy's decomposition, exactly; Model F4 · p. 417
A forecaster can be perfectly calibrated and know nothing, and a slightly miscalibrated one can still have skill: calibration is neither sufficient nor necessary for a better score, and the decomposition shows where skill comes from — resolution, net of miscalibration.
Proposition 10.12 · The subsidy buys resolution; insiders can crowd it out; stakes bunch the price; Model F5 · p. 419
A subsidised market whose closing price is calibrated pays exactly for how sharply that price separates outcomes, and a miscalibrated price hands part of the payment back; an insider adds that sharpness and collects the subsidy, but by taking the analyst's reward it can make the price less informative while leaving it perfectly calibrated; and a trader with a stake in the price crossing a line rounds nearby beliefs onto the line, which only a payment scale growing like the inverse square of the distance prevents.
Proposition 10.15 · Quotes, spread and who pays; Model F6 · p. 422
When a quarter of the orders know what a statement will say, a dealer who only breaks even must quote a spread of a quarter, and every unit the informed gain is lost by someone who traded without knowing; the less the statement is believed, or the more predictable it is, the less there is to gain.
Proposition 10.16 · The run-up is the resolution of the pre-statement price; Model F6 · p. 423
The part of a statement's move that happens before the statement is exactly the part of the uncertainty that the order flow has already resolved, so a quarter of informed orders can leave a run-up of a sixteenth; measured against the outcome the run-up shrinks as the statement is believed less, while measured against the statement's own move it does not; and a price that is perfectly calibrated before the statement says nothing about how much of the order flow knew it.
Proposition 10.17 · What a sampled audit and a flag can detect; Model F6 · p. 424
An audit that samples one order in ten will usually miss informed trading in a short window, and an alert system that is accurate order by order, but flags some innocent orders, produces mostly false alarms when informed orders are rare enough — rarer than ; a system that never flags the innocent is the exception.
Proposition 10.18 · Deterrence, and what the enforcement record shows; Model F6 · p. 424
A penalty that grows with the gain deters trading on any positive gain at a sampling rate that no market condition changes; a fixed penalty works through the spread, and the number of cases it produces need not grow with surveillance: at the base parameters it first rises and then falls as sampling tightens, and for a small enough penalty it keeps rising to full sampling — so the same count can mean twice as much informed trading under weaker surveillance.
Worked cases
From page 397 · sources checked 9 November 2026
Markets on geopolitical events
When is a market price a forecast one can read, and what do insiders and outside stakes do to it?
The mapping, the network and what the mathematics licenses →From page 404 · sources checked 10 November 2026
Official statements and the order book
What does advance knowledge of a statement cost, who pays, what does the price path reveal, and what can an audit of order flow detect?
The mapping, the network and what the mathematics licenses →A parallax in history
1904–1924 · Chapter 10 · p. 390
Distant observations, one question
1904–24: Walker builds regression forecasts of India's monsoon from distant predictors.
The WMO's ENSO Update combines expert and model judgements; shared ancestry limits their evidence (Proposition 10.7 (p. 416)).
The people
Chapter 10 · Aggregating Information
Glenn W. Brier
1913 – 1998
Statistician at the United States Weather Bureau in Washington, where for many years he headed meteorological statistics (in 1958 he was chief of the Statistics Section in its Office of Meteorological Research); later he was associated with Colorado State University. He worked on the verification and evaluation of forecasts. His 1950 note introduced the quadratic score for probability forecasts that now carries his name; it is summed over all forecast categories, so that the binary score in this chapter is half of his.
Main works
- “Verification of forecasts expressed in terms of probability” (Monthly Weather Review 78, 1950)
Chapter 10 · Aggregating Information
Leonard J. Savage
1917 – 1971
Statistician whose The Foundations of Statistics built the modern theory of subjective probability and personal decision on axioms of coherent preference. He taught at the University of Chicago (1946–60), the University of Michigan (1960–64) and Yale (1964–71). His paper on elicitation, published posthumously in December 1971, characterised the scoring rules under which announcing one's true probability is optimal — the propriety theory this chapter instantiates.
Main works
- The Foundations of Statistics (1954)
- “Elicitation of personal probabilities and expectations” (Journal of the American Statistical Association 66, 1971)
Chapter 10 · Aggregating Information
Yuri I. Zhuravlev
1935 – 2022
Mathematician, a Moscow State University graduate of 1957, who worked in Novosibirsk (1959–69) and from 1969 at the Computing Centre of the Soviet and then Russian Academy of Sciences; corresponding member of the Academy from 1984 and full member from 1992; professor at Moscow State University, where he held the chair of mathematical methods of forecasting from 1997 to 2022; working in discrete mathematics and pattern recognition. His algebraic approach to recognition treated whole families of imperfect classification algorithms as objects on which operations are defined, proving that suitable closures of such families contain correct algorithms — an algebraic perspective, developed in the late 1970s, that invites comparison with modern ensemble methods.
Main works
- “Algebras over sets of incorrect (heuristic) algorithms” (DAN SSSR 235(4), 1977)
- “On an algebraic approach to problems of recognition or classification” (Problemy kibernetiki 33, 1978)