Markov games with incomplete information

Mathematical Methods of Operations Research

Volumn 46, Issue 2, 1997, Pages 263-279

  Krausz, Alexander ^a   Rieder, Ulrich ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

Algorithms; Linear programming; Markov games with incomplete information; Optimal strategies; Repeated games

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; LINEAR PROGRAMMING; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBLEM SOLVING; STRATEGIC PLANNING;

ZERO SUM MARKOV GAMES;

GAME THEORY;

EID: 0031358167     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01217695     Document Type: Article

References (14)

1. Balinski M (1961) An algorithm for finding all vertices of convex polyhedral sets. J SIAM 9:72-88
2. Domansky V, Kreps V (1994) "Eventually revealing" repeated games with incomplete information. Internat. J. Game Theory 23:89-99
3. Domansky V, Kreps V (1995) Repeated games and multinomial distribution. Mathem. Meth. Operat. Res. 42:275-293
4. Filar J, Vrieze K (1997) Competitive Markov decision processes. Springer-Verlag, New York
5. Heuer M (1991) Optimal strategies for the uninformed player. Internat. J. Game Theory 20:33-51
6. Mattheiss T (1973) An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities. Operations Research 21:247-260
7. Meloudakis C (1984) On stochastic games with lack of information on one side. PhD Thesis, University of California, Los Angeles
8. Meloudakis C (1989) On stochastic games with lack of information on one side. Internat. J. Game Theory 18:1-29
9. Melolidakis C (1991) Stochastic games with lack of information on one side and positive stop probabilities. In: Raghavan TES et al. (eds): Stochastic games and related topics, Kluwer Academic Publishers, pp. 113-126
10. Mertens JF, Sorin S, Zamir S (1994) Repeated games. Core Discussion Paper 9420, 9421, 9422, Université Catholique de Louvain
11. Nowak AS (1986) Semicontinuous non-stationary stochastic games. J Math. Anal. Appl. 117:84-89
12. Ponssard JP, Sorin S (1980) The LP formulation of finite zero-sum games with incomplete information. Internat. J Game Theory 9.99-105
13. Rieder U (1975) Bayesian dynamic programming. Adv. Appl. Prob. 7:330-348
14. Rieder U (1978) On semi-continuous dynamic games. Technical Report, Universität Karlsruhe