2015-06-232015-06-2320090166-218Xhttp://grupo.us.es/gpb97/curri_sevilla/doc/VersionDOI.pdfhttp://hdl.handle.net/11441/26023This 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.application/pdfengAtribución-NoComercial-SinDerivadas 4.0 Españahttp://creativecommons.org/licenses/by-nc-nd/4.0Dynamic programmingMarkov processesRecreationinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess10.1016/j.ejor.2006.10.041