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.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- D. Blackwell, 2010. "An Analog of the Minmax Theorem for Vector Payoffs," Levine's Working Paper Archive 466, David K. Levine.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:29:y:1999:i:1-2:p:73-78. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.