If you need an accessible version of this item please contact JSTOR User Support

Asymptotic Calibration

Dean P. Foster and Rakesh V. Vohra
Biometrika
Vol. 85, No. 2 (Jun., 1998), pp. 379-390
Published by: Oxford University Press on behalf of Biometrika Trust
Stable URL: http://www.jstor.org/stable/2337364
Page Count: 12
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Asymptotic Calibration
Preview not available

Abstract

Can we forecast the probability of an arbitrary sequence of events happening so that the stated probability of an event happening is close to its empirical probability? We can view this prediction problem as a game played against Nature, where at the beginning of the game Nature picks a data sequence and the forecaster picks a forecasting algorithm. If the forecaster is not allowed to randomise, then Nature wins; there will always be data for which the forecaster does poorly. This paper shows that, if the forecaster can randomise, the forecaster wins in the sense that the forecasted probabilities and the empirical probabilities can be made arbitrarily close to each other.

Page Thumbnails

  • Thumbnail: Page 
[379]
    [379]
  • Thumbnail: Page 
380
    380
  • Thumbnail: Page 
381
    381
  • Thumbnail: Page 
382
    382
  • Thumbnail: Page 
383
    383
  • Thumbnail: Page 
384
    384
  • Thumbnail: Page 
385
    385
  • Thumbnail: Page 
386
    386
  • Thumbnail: Page 
387
    387
  • Thumbnail: Page 
388
    388
  • Thumbnail: Page 
389
    389
  • Thumbnail: Page 
390
    390