A Proof of Calibration Via Blackwell's Approachability Theorem
Over the past few years many proofs of calibration have been presented (Foster and Vohra (1991, 1997), Hart (1995), Fudenberg and Levine (1995), Hart and Mas-Colell (1996)). Does the literature really need one more? Probably not, but this algorithim for being calibrated is particularly simple and doesn't require a matrix inversion. Further the proof follows directly from Blackwell's approachability theorem. For these reasons it might be useful in the class room.
Year of publication: |
1997-02
|
---|---|
Authors: | Foster, Dean P. |
Institutions: | Center for Mathematical Studies in Economics and Management Science (CMS-EMS), Kellogg Graduate School of Management |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Calibration, Expected Utility and Local Optimality
Foster, Dean P., (1999)
-
An Information Theoretic Comparison of Model Selection Criteria
Foster, Dean P., (1997)
-
Accounting for Cognitive Costs in On-Line Auction Design
Parkes, David C., (1999)
- More ...