Duality and optimal strategies in the finitely repeated zero-sum games with incomplete information on both sides
The recursive formula for the value of the zero-sum repeated games with incomplete information on both sides is known for a long time. As it is explained in the paper, the usual proof of this formula is in a sense non constructive : it just claims that the players are unable to guarantee a better payoff than the one prescribed by formula, but it does not indicates how the players can guarantee this amount. In this paper we aim to give a constructive approach to this formula using duality techniques. This will allow us to recursively describe the optimal strategies in those games and to apply these results to games with infinite action spaces.
|Date of creation:||Mar 2005|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: 01 44 07 81 00
Fax: 01 44 07 81 09
Web page: http://mse.univ-paris1.fr/
More information through EDIRC
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.:
- DE MEYER , Bernard, 1993. "Repeated Games and the Central Limit Theorem," CORE Discussion Papers 1993003, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Bernard De Meyer & Alexandre Marino, 2004. "Repeated market games with lack of information on both sides," Cahiers de la Maison des Sciences Economiques bla04066, Université Panthéon-Sorbonne (Paris 1).
When requesting a correction, please mention this item's handle: RePEc:mse:wpsorb:b05027. 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: (Lucie Label)
If references are entirely missing, you can add them using this form.