Randomization, derandomization and antirandomization: three games

J. Spencer

Research output: Contribution to journalArticlepeer-review


Three games are given between two players, Paul and Carole, with a common theme. In each round Paul does a split and Carole chooses. Random play by Carole allows a bound for the game value. Through derandomization this becomes a deterministic strategy for Carole minimizing a weight function. Paul can use that same weight function to give a bound for the game value in the other direction.

Original languageEnglish (US)
Pages (from-to)415-429
Number of pages15
JournalTheoretical Computer Science
Issue number2
StatePublished - Sep 12 1994

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Randomization, derandomization and antirandomization: three games'. Together they form a unique fingerprint.

Cite this