Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01st74cs786
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Appel, Andrew | - |
dc.contributor.author | Ullman, Robert | - |
dc.date.accessioned | 2015-06-26T16:10:19Z | - |
dc.date.available | 2015-06-26T16:10:19Z | - |
dc.date.created | 2015-04-30 | - |
dc.date.issued | 2015-06-26 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp01st74cs786 | - |
dc.description.abstract | We create modular software to construct and solve general hold’em poker games. Because most poker variants, like Texas Hold’em, are prohibitively complicated to analyze directly, we instead use the flexibility of our software to look at a variety of stripped-down hold’em-like games. In these simplified games, we answer questions about how game rules, player position, and betting history affect a player’s strategy to give insight into optimal strategies for more complicated poker variants. We simulate these variants with collusion and find that collusion leads to an overall increase in aggression by colluding players. We find that although strong collusion leads to a significant advantage for colluding players, weak collusion does not. | en_US |
dc.format.extent | 29 pages | en_US |
dc.language.iso | en_US | en_US |
dc.title | Optimal Poker Strategies Under Collusion Simulating Fictitious Play in Simplified Poker Variants | en_US |
dc.type | Princeton University Senior Theses | - |
pu.date.classyear | 2015 | en_US |
pu.department | Computer Science | en_US |
pu.pdf.coverpage | SeniorThesisCoverPage | - |
Appears in Collections: | Computer Science, 1988-2020 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
PUTheses2015-Ullman_Robert.pdf | 706.81 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.