Optimal strategy in the game show, "1 vs. 100"

Author

Seth A. Hoxworth

Date Approved

2008

Degree Type

Open Access Senior Honors Thesis

Department or School

Mathematics

Abstract

In this paper, we will be using a simplified method (a geometric distribution statistical approach) and move through a more detailed approach (using dynamic programming) to analyze when contestants should quit versus when they should stay in the TV game show “1 vs. 100.” We will observe optimal contestants’ strategies for when they should statistically quit answering questions or stay for the highest probability of a contestant win and the greatest possible expected amount of money to walk away with.

Recommended Citation

Hoxworth, Seth A., "Optimal strategy in the game show, "1 vs. 100"" (2008). Senior Honors Theses and Projects. 157.
https://commons.emich.edu/honors/157