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)

Full work available at URL https://doi.org/10.1137/S0097539791202301

zbMATH Keywords

bounded rationalitycomputable winning strategycomputer against extremely formidable naturediagonalization techniqueinfinite gamesinfinite two-person gamesonline computingpower of randomizationsemicomputably determinate

Mathematics Subject Classification ID

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

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)