When can limited randomness be used in repeated games?

DOI10.1007/s00224-016-9690-4zbMath1356.91010arXiv1507.01191OpenAlexW782722446MaRDI QIDQ506541

Pavel Hubáček, Moni Naor, Jonathan R. Ullman

Publication date: 1 February 2017

Published in: Theory of Computing Systems, Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.01191

zbMATH Keywords

entropygame theorycryptographyNash equilibriumrepeated gamespseudorandom generatorsone-way functionsfinitely repeated gameslimited randomness

Mathematics Subject Classification ID

Noncooperative games (91A10) Random number generation in numerical analysis (65C10) Signaling and communication in game theory (91A28) Multistage and repeated games (91A20)

Related Items (1)

Playing games with bounded entropy

Cites Work

• Unnamed Item
• Unnamed Item
• Nash equilibria of finitely repeated games
• Strategic entropy and complexity in repeated games
• Repeated games with bounded entropy
• Algorithmic rationality: game theory with costly computation
• Finitely repeated games: a generalized Nash folk theorem
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Algorithms for Playing Games with Limited Randomness
• Finitely Repeated Games
• A Pseudorandom Generator from any One-way Function
• Foundations of Cryptography
• Long Cheap Talk

This page was built for publication: When can limited randomness be used in repeated games?