Solution for a class of repeated games without a recursive structure

DOI10.1007/BF01769882zbMath0541.90101MaRDI QIDQ794937

Christine M. Waternaux

Publication date: 1983

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

zbMATH Keywords

incomplete informationarbitrationinformation matriceschance moveinfinitely repeated two-person zero-sum gamestwo- person game

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15)

Related Items (7)

Existence of value for a differential game with asymmetric information and signal revealing ⋮ The Minmax Theorem for U.S.C.-L.S.C. payoff functions ⋮ On repeated games without a recursive structure: Existence of \(\lim v_ n\) ⋮ A note on the monotonicity of \(V_{n}\) ⋮ Repeated Games with Incomplete Information ⋮ ``Big Match with lack of information on one side. I ⋮ On a repeated game with state dependent signalling matrices

Cites Work

• Unnamed Item
• On general minimax theorems
• Minmax and maxmin of repeated games with incomplete information
• Repeated games with absorbing states
• Repeated games of incomplete information: The symmetric case
• Optimal strategies in repeated games with incomplete information
• On a repeated game without a recursive structure
• The value of two-person zero-sum repeated games. The extensive case
• The value of two-person zero-sum repeated games with lack of information on both sides

This page was built for publication: Solution for a class of repeated games without a recursive structure