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.
|Date of creation:||Feb 1997|
|Date of revision:|
|Contact details of provider:|| Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014|
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
|Order Information:|| Email: |
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:nwu:cmsems:1182. 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: (Fran Walker)
If references are entirely missing, you can add them using this form.