On stochastic games with lack of information on one side

DOI10.1007/BF01248492zbMath0669.90101MaRDI QIDQ1119190

Costis Melolidakis

Publication date: 1989

Published in: International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

Markov chainlimiting expected average payoff criterionstochastic game with lack of information on

Mathematics Subject Classification ID

Dynamic programming (90C39) Stochastic games, stochastic differential games (91A15) Multistage and repeated games (91A20) Probabilistic games; gambling (91A60)

Related Items (2)

Markov games with incomplete information ⋮ On stochastic games with lack of information on one side

Cites Work

• On stochastic games with lack of information on one side
• The LP formulation of finite zero-sum games with incomplete information
• Minmax and maxmin of repeated games with incomplete information
• The value of two-person zero-sum repeated games with lack of information on both sides
• Zero-sum sequential games with incomplete information
• On von Neumann's minimax theorem
• On Stochastic Games with Stationary Optimal Strategies
• Unnamed Item

This page was built for publication: On stochastic games with lack of information on one side