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 language | English (US) |
---|---|
Pages (from-to) | 415-429 |
Number of pages | 15 |
Journal | Theoretical Computer Science |
Volume | 131 |
Issue number | 2 |
DOIs | |
State | Published - Sep 12 1994 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science