Provably Bounded-Optimal Agents.

Russell, S., & Subramanian, D. (1995). Provably Bounded-Optimal Agents. Journal of Artificial Intelligence Research, 575-609.

Type

Journal article

Intellectual base

Primary research

Year

1995

Pages

575-609

DOI

10.1613/jair.133

DOI registrant

AI Access Foundation

Link

https://doi.org/10.1613/jair.133

Cited from

behavioral_economics

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Bounded Rationality
  • - Artificial intelligence and computer science. Heuristic search, anytime algorithms, and bounded-optimality frameworks make bounded rationality an engineering principle: systems must decide well within computational budgets.

    This sourceBounded optimality as constrained optimization over an agent's program given architecture and task environment; supports the AI/anytime-algorithm and engineering-of-procedures-under-resource-budgets claims.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:4a58a5543568 · see in the full table