scientific article; zbMATH DE number 1149416

zbMATH Open0900.68091MaRDI QIDQ4386937FDOQ4386937

Authors:

Publication date: 10 May 1998

Title of this publication is not available (Why is that?)

Recommendations

• Asymptotically optimal agents
• Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory
• Optimality issues of universal greedy agents with static priors
• Asymptotic non-learnability of universal agents with computable horizon functions

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited In (20)

• Rationality and intelligence
• The computational complexity of scenario-based agent verification and design
• BRA: an algorithm for simulating bounded rational agents
• Optimality issues of universal greedy agents with static priors
• Asymptotically optimal agents
• Information-theoretic bounded rationality and \(\epsilon\)-optimality
• Asymptotic non-learnability of universal agents with computable horizon functions
• Monitoring and control of anytime algorithms: A dynamic programming approach
• The independent choice logic for modelling multiple agents under uncertainty
• The complexity of agent design problems: Determinism and history dependence
• Coalitions among computationally bounded agents
• On continuous time agents
• Induction over constrained strategic agents
• Reward is enough
• Formalization of methods for the development of autonomous artificial intelligence systems
• Bounded rationality and control
• Bounded rationality and control
• A Theory of Bounded Inductive Rationality
• Bargaining with limited computation: Deliberation equilibrium
• Systems of Bounded Rational Agents with Information-Theoretic Constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386937)