The Cost of Derandomization: Computability or Competitiveness

DOI10.1137/S0097539791202301MaRDI QIDQ4337632zbMATH OpenFDO

Authors Xiaotie Deng, Sanjeev Mahajan

Publication date 26 May 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

bounded rationalityinfinite gamesdiagonalization techniqueonline computingcomputable winning strategycomputer against extremely formidable natureinfinite two-person gamespower of randomizationsemicomputably determinate

Mathematics Subject Classification ID

Multistage and repeated games (91A20) Ordinal and cardinal numbers (03E10) Theory of computing (68Q99)

Recommendations

• Computability and randomness of Nash equilibrium in infinite games
• Polynomial games and determinacy
• Randomization, derandomization and antirandomization: Three games
• Playing off-line games with bounded rationality
• Non-computable strategies and discounted repeated games

This page was built for publication: The Cost of Derandomization: Computability or Competitiveness

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