| Article ID: | iaor19982928 |
| Country: | Germany |
| Volume: | 46 |
| Issue: | 2 |
| Start Page Number: | 263 |
| End Page Number: | 279 |
| Publication Date: | Jan 1997 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Rieder U., Krausz A. |
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.