Randomization, derandomization and antirandomization: three games

Research output: Contribution to journalArticle

Abstract

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
Volume131
Issue number2
DOIs
StatePublished - Sep 12 1994

Fingerprint

Derandomization
Randomisation
Game
Weight Function
Choose

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Randomization, derandomization and antirandomization : three games. / Spencer, J.

In: Theoretical Computer Science, Vol. 131, No. 2, 12.09.1994, p. 415-429.

Research output: Contribution to journalArticle

@article{40639387d033415392d81670d044e838,
title = "Randomization, derandomization and antirandomization: three games",
abstract = "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.",
author = "J. Spencer",
year = "1994",
month = "9",
day = "12",
doi = "10.1016/0304-3975(94)90181-3",
language = "English (US)",
volume = "131",
pages = "415--429",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Randomization, derandomization and antirandomization

T2 - three games

AU - Spencer, J.

PY - 1994/9/12

Y1 - 1994/9/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028501192&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028501192&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(94)90181-3

DO - 10.1016/0304-3975(94)90181-3

M3 - Article

AN - SCOPUS:0028501192

VL - 131

SP - 415

EP - 429

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -