Markov games with incomplete information

DOI10.1007/BF01217695zbMath0889.90174MaRDI QIDQ1374696

Ulrich Rieder, Alexander Krausz

Publication date: 10 December 1997

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

algorithmslinear programmingrepeated gamesoptimal strategiesMarkov games with incomplete information

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Cooperative games (91A12) Linear programming (90C05) 2-person games (91A05) Multistage and repeated games (91A20)

Related Items

Average optimal strategies for zero-sum Markov games with poorly known payoff function on one side ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ Stochastic Games ⋮ Zero-sum Markov games with random state-actions-dependent discount factors: existence of optimal strategies ⋮ Estimation of Equilibria in an Advertising Game with Unknown Distribution of the Response to Advertising Efforts ⋮ Adaptive policy for two finite Markov chains zero-sum stochastic game with unknown transition matrices and average payoffs

Cites Work

• Semicontinuous nonstationary stochastic games
• On stochastic games with lack of information on one side
• The LP formulation of finite zero-sum games with incomplete information
• Optimal strategies for the uninformed player
• ``Eventually revealing repeated games with incomplete information
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
• Bayesian dynamic programming
• Repeated games and multinomial distributions
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item