When does a random Robin Hood win?

DOI10.1016/S0304-3975(03)00289-5zbMath1052.91011OpenAlexW2094703318MaRDI QIDQ1401420

Aravind Srinivasan, William I. Gasarch, Evan Golub

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00289-5

zbMATH Keywords

StrategyGamesRandomized strategy

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items (1)

Limit theorem for the Robin Hood game

Cites Work

• Unnamed Item
• A game of D. Gale in which one of the players has limited memory
• Variations on a game of Gale. II: Markov strategies
• Variations on a game of Gale (III): remainder strategies
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: When does a random Robin Hood win?