Identifier

232

Date

2023

Document Type

Honors Thesis

Degree Name

Bachelor of Science

Major

Mathematical Sciences

Concentration

Mathematics

Committee Chair

Thomas Hagen

Abstract

Given three dice, can we place the numbers 1 through 6 on the dice, allowing repetitions, so that after a first player chooses one die of the three, the second player can always choose a die with a higher probability of rolling a greater number from the remaining two? If so, is it possible to optimize the chances of winning both by theoretical and computational means? This research project draws on techniques from probability theory, combinatorics, complexity theory, game theory, and scientific computing. The topic falls in the category of non-transitive games, a research area in mathematics and economics, and combines theoretical and practical methods.

Comments

Undergraduate Honor's Thesis

Library Comment

Honors thesis originally submitted to the Local University of Memphis Honor’s Thesis Repository.

Notes

Data is provided by the student.

Download

Share

COinS