The speed of convergence in repeated games with incomplete information on one side
In a repeated two-person zero-sum game with incomplete information on one side, the values vn of the n-stage games converge to the value v\infty of the infinite game with worst case error \sim(ln n/n)1/3.
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.
Volume (Year): 27 (1998)
Issue (Month): 3 ()
|Note:||Received February 1995/Revised Version May 1997|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/182/PS2|