Probabilistic game automata

DOI10.1016/0022-0000(88)90038-4zbMath0682.68072OpenAlexW186014684MaRDI QIDQ1824400

Anne Condon, Richard E. Ladner

Publication date: 1988

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(88)90038-4

zbMATH Keywords

two-person gamealternating Turing machinesgames against unknown natureprobabilistic game automaton

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) 2-person games (91A05) Formal languages and automata (68Q45)

Related Items

On the complexity of computational problems associated with simple stochastic games, Multi-oracle interactive protocols with constant space verifiers, Debates with Small Transparent Quantum Verifiers, Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata, Computation of equilibria in noncooperative games

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• Solitaire automata
• The complexity of logical theories
• Finite Continuous Time Markov Chains
• Alternation
• Computational Complexity of Probabilistic Turing Machines
• The knowledge complexity of interactive proof-systems