Learning to win process-control games watching game-masters

DOI10.1006/INCO.2000.2946zbMath1009.68116OpenAlexW2080459901MaRDI QIDQ1854518

Frank Stephan, John Case, Matthias Ott, Arun Sharma

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fcbfc9a84e9a4479bad0576dd74f21cfa4ca5466

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Rationality and learning in game theory (91A26)

Related Items (4)

Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ The Existential Fragment of the One-Step Parallel Rewriting Theory ⋮ Structural measures for games and process control in the branch learning model ⋮ On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms

Uses Software

• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• On the structure of degrees of inferability.
• Recursively presented games and strategies
• Learning with the knowledge of an upper bound on program size
• Classical recursion theory. Vol. II
• Infinite games played on finite graphs
• Learning recursive functions from approximations
• Structural measures for games and process control in the branch learning model
• Inference of finite automata using homing sequences
• Probabilistic inductive inference
• The Power of Pluralism for Automatic Program Synthesis
• Π₀¹-classes and Rado's selection principle
• On the synthesis of discrete controllers for timed systems
• Solving Sequential Conditions by Finite-State Strategies

This page was built for publication: Learning to win process-control games watching game-masters