Dynamic programming analysis of the TV game ``Who wants to be a millionaire?

DOI10.1016/J.EJOR.2006.10.041MaRDI QIDQ2371371zbMATH OpenOpenAlexWikidataFDO

Authors Federico Perea, Justo Puerto

Publication date 4 July 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://idus.us.es/xmlui/handle/11441/26023

zbMATH Keywords

dynamic programmingMarkov processesrecreation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39)

Recommendations

• The best banking strategy when playing The Weakest Link
• scientific article; zbMATH DE number 2166520
• The \textit{Who Wants to be a Millionaire} dilemma
• Publication:4892242
• Dynamic programming and board games: a survey

Cites work

• Dynamic programming and board games: a survey
• Dynamic programming in cricket: choosing a night watchman
• The best banking strategy when playing The Weakest Link
• Variable wager HI-LO: a stochastic dynamic programming analysis

Cited in

(7)

• Computing rank dependent utility in graphical models for sequential decision problems
• Who wants a computer to be a millionaire?
• The \textit{Who Wants to be a Millionaire} dilemma
• scientific article; zbMATH DE number 2166520 (Why is no real title available?)
• Variable wager HI-LO: a stochastic dynamic programming analysis
• Optimal strategies in the fighting fantasy gaming system: influencing stochastic dynamics by gambling with limited resource
• The best banking strategy when playing The Weakest Link

This page was built for publication: Dynamic programming analysis of the TV game ``Who wants to be a millionaire?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371371)