On computable beliefs of rational machines

DOI10.1016/0899-8256(89)90016-XzbMath0755.90106OpenAlexW2051671299MaRDI QIDQ1191819

Nimrod Megiddo

Publication date: 27 September 1992

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0899-8256(89)90016-x

zbMATH Keywords

approximate beliefsrational machines

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Decision theory for games (91A35)

Related Items (3)

Algorithmic rationality: game theory with costly computation ⋮ Communication, computability, and common interest games ⋮ Forecasting errors and bounded rationality: An example

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formulation of Bayesian analysis for games with incomplete information
• On repeated games with incomplete information played by non-Bayesian players
• Concerning measures in first order calculi

This page was built for publication: On computable beliefs of rational machines