A solution to the game of googol
type: Item
instance of: scholarly article
title: A solution to the game of googol
zbMATH Open document ID: 0815.60038
author: Alexander Gnedin
published in: The Annals of Probability
publication date: 1995-06-30T00:00:00Z
review text: For every \(n > 2\) exchangeable random variables \(X_ 1,\dots,X_ n\) are constructed for which, among all stopping rules \(\tau\) based on the \(X_ i\), \(\text{sup}_ \tau P(X_ \tau = \max(X_ 1,\dots,X_ n))\) is attained by a rule based only on the relative ranks of the \(X_ i\). The underlying distribution serves as a minimax rule for one of the players in the ``game of googol''.
reviewed by: Wolfgang Stadje
Mathematics Subject Classification ID: 60G40
zbMATH DE Number: 731993
zbMATH Keywords: best choice problem
zbMATH Keywords: minimax strategy
zbMATH Keywords: exchangeable random variables
Wikidata QID: Q57309398
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aop/1176988613
OpenAlex ID: W2018476046
DOI: 10.1214/AOP/1176988613
description: scientific article; zbMATH DE number 731993