Poker is a complex game to analyze. In this project we will use the mathematics of game theory to solve some simplified variations of the game. Probability is the building block behind game theory. We must understand a few concepts from probability such as distributions, expected value, variance, and enumeration methods to aid us in studying game theory. We will solve and analyze games through game theory by using different decision methods, decision trees, and the process of domination and simplification. Poker models, with and without cards, will be provided to illustrate optimal strategies. Extensions to those models will be presented, and we will show that optimal strategies still exist. Finally, we will close this paper with an original work to an extension that can be used as a medium to creating more extensions and, or, different games to explore.
Identifer | oai:union.ndltd.org:csusb.edu/oai:scholarworks.lib.csusb.edu:etd-1378 |
Date | 01 June 2016 |
Creators | Palafox, Damian |
Publisher | CSUSB ScholarWorks |
Source Sets | California State University San Bernardino |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | Electronic Theses, Projects, and Dissertations |
Page generated in 0.0016 seconds