Existence of optimal strategies in Markov games with incomplete information (Q999122): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2753357 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Value of Markov Chain Games with Lack of Information on One Side / rank | |||
Normal rank |
Latest revision as of 01:17, 29 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Existence of optimal strategies in Markov games with incomplete information |
scientific article |
Statements
Existence of optimal strategies in Markov games with incomplete information (English)
0 references
30 January 2009
0 references
The existence of the value and optimal strategies is proved for the class of two-person repeated games where the state follows an exogeneous Markov chain, and at the beginning of each stage only Player 1 is informed about the state. This model was first introduced and the existence of the value was proved in [\textit{J. Renault}, Math. Oper. Res. 31, No. 3, 490-512 (2006; Zbl 1276.91023)]. Here the proof uses classical repeated games with incomplete information on one side, and the case of non observable actions is also considered.
0 references
Repeated games
0 references
Repeated games with incomplete information
0 references
Markov chain games
0 references