Show simple item record

Article

dc.creatorMarín, Alfredo
dc.creatorNickel, Stefan
dc.creatorPuerto Albandoz, Justo
dc.creatorVelten, Sebastian
dc.date.accessioned2015-06-23T13:56:33Z
dc.date.available2015-06-23T13:56:33Z
dc.date.issued2009
dc.identifier.issn0166-218X
dc.identifier.otherhttp://grupo.us.es/gpb97/curri_sevilla/doc/VersionDOI.pdf
dc.identifier.urihttp://hdl.handle.net/11441/26023
dc.description.abstractThis 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.
dc.formatapplication/pdf
dc.language.isoeng
dc.publisherElsevier
dc.relation.ispartofDiscrete Applied Mathematics, 157(5), 1128-1145
dc.rightsAtribución-NoComercial-SinDerivadas 4.0 España
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectDynamic programming
dc.subjectMarkov processes
dc.subjectRecreation
dc.titleDynamic programming analysis of the tv game Who Wants to Be a Millionaire?
dc.typeinfo:eu-repo/semantics/article
dc.type.versioninfo:eu-repo/semantics/submittedVersion
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Estadística e Investigación Operativa
dc.relation.publisherversion10.1016/j.dam.2008.03.013
dc.relation.publisherversionhttps://www.sciencedirect.com/science/article/pii/S0377221706010320
dc.identifier.doi10.1016/j.ejor.2006.10.041es
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/26023

FilesSizeFormatViewDescription
file_1.pdf907.5KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Atribución-NoComercial-SinDerivadas 4.0 España
Except where otherwise noted, this item's license is described as: Atribución-NoComercial-SinDerivadas 4.0 España