Published September 2008
| Published
Journal Article
Open
Many inspections are manipulable
- Creators
- Shmaya, Eran
Chicago
Abstract
A self-proclaimed expert uses past observations of a stochastic process to make probabilistic predictions about the process. An inspector applies a test function to the infinite sequence of predictions provided by the expert and the observed realization of the process in order to check the expert's reliability. If the test function is Borel and the inspection is such that a true expert always passes it, then it is also manipulable by an ignorant expert. The proof uses Martin's theorem about the determinacy of Blackwell games. Under the axiom of choice, there exist non-Borel test functions that are not manipulable.
Additional Information
Copyright © 2008 Eran Shmaya. Licensed under the Creative Commons Attribution-NonCommercial License 3.0. Available at http://econtheory.org. Submitted 2007-10-28. Final version accepted 2008-7-6. Available online 2008-7-6. This paper was written while I was a research fellow in the Social and Information Sciences Laboratory at California Institute of Technology. I am grateful to Federico Echenique for detailed comments and suggestions that substantially improved the paper, and also to Chris Chambers, Eddie Dekel, Yossi Feinberg, Nabil Al-Najjar, Wojciech Olszewski, Alvaro Sandroni, and Leeat Yariv.Attached Files
Published - SHMAte08.pdf
Files
SHMAte08.pdf
Files
(246.1 kB)
Name | Size | Download all |
---|---|---|
md5:7eac8ab87249d4a3d3330ab16bcce75a
|
246.1 kB | Preview Download |
Additional details
- Eprint ID
- 11690
- Resolver ID
- CaltechAUTHORS:SHMAte08
- Created
-
2008-09-19Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field