Artículo
Dynamic programming analysis of the tv game Who Wants to Be a Millionaire?
Autor/es | Marín, Alfredo
Nickel, Stefan Puerto Albandoz, Justo Velten, Sebastian |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2009 |
Fecha de depósito | 2015-06-23 |
Publicado en |
|
Resumen | This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionaire?’. It obtains the optimal strategies to ... This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionaire?’. It obtains the optimal strategies to maximize the expected reward and to maximize the probability of winning a given amount of money. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
file_1.pdf | 907.5Kb | [PDF] | Ver/ | |