THE FRONTIER OF DECIDABILITY IN PARTIALLY OBSERVABLE RECURSIVE GAMES

DOI10.1142/S0129054112400576zbMath1264.91027OpenAlexW2096673683MaRDI QIDQ4923289

David Auger, Olivier Teytaud

Publication date: 6 June 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054112400576

zbMATH Keywords

game theorypartial information

Mathematics Subject Classification ID

2-person games (91A05) Signaling and communication in game theory (91A28) Decision theory for games (91A35)

Cites Work

• On the undecidability of probabilistic planning and related stochastic optimization problems
• GO Is Polynomial-Space Hard
• Recursively enumerable sets of positive integers and their decision problems

Related Items (1)

Unnamed Item

This page was built for publication: THE FRONTIER OF DECIDABILITY IN PARTIALLY OBSERVABLE RECURSIVE GAMES