scientific article; zbMATH DE number 592681

MaRDI QIDQ4296864zbMATH OpenFDO

Authors Nimrod Megiddo

Publication date 13 July 1994

zbMATH Keywords

average-case complexitybounded rationalityprobabilistic machines

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Learning and adaptive systems in artificial intelligence (68T05) Game theory (91A99)

Recommendations

• Complexity of games and bounded rationality
• The complexity of computing a best response automaton in repeated games with mixed strategies
• Algorithmic rationality: game theory with costly computation
• Bounded rationality, strategy simplification, and equilibrium
• Non-computable strategies and discounted repeated games

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 Q4296864)