The Complexity of Forecast Testing

Lance Fortnow and Rakesh V. Vohra

Econometrica, 2009, vol. 77, issue 1, pages 93-105

Abstract: Consider a weather forecaster predicting a probability of rain for the next day. We consider tests that, given a finite sequence of forecast predictions and outcomes, will either pass or fail the forecaster. Sandroni showed that any test which passes a forecaster who knows the distribution of nature can also be probabilistically passed by a forecaster with no knowledge of future events. We look at the computational complexity of such forecasters and exhibit a linear-time test and distribution of nature such that any forecaster without knowledge of the future who can fool the test must be able to solve computationally difficult problems. Thus, unlike Sandroni's work, a computationally efficient forecaster cannot always fool this test independently of nature. Copyright 2009 The Econometric Society.

Date: 2009

Downloads: (external link)
http://hdl.handle.net/10.3982/ECTA7163 link to full text (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:ecm:emetrp:v:77:y:2009:i:1:p:93-105

Ordering information: This journal article can be ordered from
http://www.blackwell ... mb.asp?ref=0012-9682

Access Statistics for this article

Econometrica is edited by Stephen Morris

More articles in Econometrica from Econometric Society
Contact information at EDIRC.
Series data maintained by Christopher F. Baum ().