Bernard De Meyer () (CERMSEM - CEntre de Recherche en Mathématiques, Statistique et Économie Mathématique - CNRS : UMR8095 - Université Panthéon-Sorbonne - Paris I) Alexandre Marino () (CERMSEM - CEntre de Recherche en Mathématiques, Statistique et Économie Mathématique - CNRS : UMR8095 - Université Panthéon-Sorbonne - Paris I)
Additional information is available for the following
registered author(s):
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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Length: Date of creation: Mar 2005 Date of revision: Handle: RePEc:hal:cesptp:halshs-00193996_v1
Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00193996/en/ Contact details of provider: Web page: http://hal.archives-ouvertes.fr/
For technical questions regarding this item, or to correct its listing, contact: (CCSD).
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.: