Any Inspection is Manipulable (Q4531035)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1746851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Any Inspection is Manipulable |
scientific article; zbMATH DE number 1746851 |
Statements
Any Inspection is Manipulable (English)
0 references
28 May 2002
0 references
mixed calibration tests
0 references
average prediction
0 references
forecasting scheme
0 references
forecaster
0 references
inspector
0 references
realizations
0 references
principle of approachability
0 references
Blackwell's approachability theorem
0 references
checking rules
0 references
manipulative forecast
0 references
span
0 references
sampling rules
0 references
games with payoffs in infinite dimensional spaces
0 references
0.8445310592651367
0 references
0.7997289896011353
0 references
0.7957527041435242
0 references
0.7875142097473145
0 references
0.7757084965705872
0 references
The calibration tests treated in the literature are pure: After any history it is known what specific event (for instance, `rain', `foggy') is being considered. Here, mixed calibration tests are introduced, where, after each history, a randomly chosen event is checked. A mixed test checks whether the average prediction of these randomly chosen events is asymptotically equal to the frequency of their realizations. Like a deterministic test, a mixed calibration test is also type \(I\)-error free. The main result of this paper shows that there is no mixed calibration test that rejects any inaccurate forecast. That is, for any test of this kind, there exists a forecasting scheme that is always consistent with the realized events. A constructive method to produce this scheme is provided as well. Another interpretation of the main result involves a forecaster and an inspector. The inspector randomly chooses a calibration test according to a known distribution. It is shown that a forecaster, without knowing anything regarding the way states are selected can pass almost every test chosen by the inspector, independently of the sequence of realizations. In other words, the forecaster has a forecasting method that is consistent with the observed facts in the meaning induced by almost all tests. Instead of randomly choosing one test, as discussed previously, the inspector can employ a set of tests simultaneously. The main result implies that if the inspector employs countably many calibration tests, for instance all those computable by a Turing machine, a forecaster can, likewise, pass them all simultaneously. It means that a consultant or a scientist (e.g., a weather forecaster) who knows the (countable) set of tests his model needs to pass, can manipulate. That is, no matter what the sequence of realizations is, his manipulative forecast will pass all the tests. The proof of the main result relies on an extension of Blackwell's approachability theorem to games with payoffs in infinite dimensional spaces.
0 references