Mertens, Jean-François
[UCL]
In a repeated two-person zero-sum game with incomplete information on one side, the values upsilon(n) of the n-stage games converge to the value upsilon(infinity) of the infinite game with worst case error similar to (ln n/n)(1/3).
Bibliographic reference |
Mertens, Jean-François. The speed of convergence in repeated games with incomplete information on one side. In: International Journal of Game Theory, Vol. 27, no. 3, p. 343-357 (1998) |
Permanent URL |
http://hdl.handle.net/2078.1/45586 |