论文信息 - Markov games with incomplete information

Markov games with incomplete information

We consider zero-sum Markov games with incomplete information. Here, the second player is never informed about the current state of the underlying Markov chain. The existence of a value and of optimal strategies for both players is shown. In particular, we present finite algorithms for computing optimal strategies for the informed and uninformed player. The algorithms are based on linear programming results.

Ulrich Rieder | Alexander Krausz | U. Rieder | Alexander Krausz

[1] T. H. Mattheiss,et al. An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities , 1973, Oper. Res..

[2] C. Melolidakis. On Stochastic Games with Lack of Information on One Side , 1989 .

[3] Andrzej S. Nowak,et al. Semicontinuous nonstationary stochastic games II , 1986 .

[4] S. Sorin,et al. The LP formulation of finite zero-sum games with incomplete information , 1980 .

[5] Costis Melolidakis. Stochastic Games with Lack of Information on One Side and Positive Stop Probabilities , 1991 .

[6] Robert J. Aumann,et al. Repeated Games with Incomplete Information , 1995 .

[7] M. Balinski. An algorithm for finding all vertices of convex polyhedral sets , 1959 .

[8] Jerzy A. Filar,et al. Competitive Markov decision processes : with 57 illustrations , 1997 .

[9] U. Rieder. Bayesian dynamic programming , 1975, Advances in Applied Probability.

[10] Victoria L. Kreps,et al. “Eventually revealing” repeated games with incomplete information , 1994 .

[11] Martin Heuer,et al. Optimal strategies for the uninformed player , 1991 .

[12] Victor Domansky,et al. Repeated games and multinomial distributions , 1995, Math. Methods Oper. Res..