Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01st74cs786
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorAppel, Andrew-
dc.contributor.authorUllman, Robert-
dc.date.accessioned2015-06-26T16:10:19Z-
dc.date.available2015-06-26T16:10:19Z-
dc.date.created2015-04-30-
dc.date.issued2015-06-26-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp01st74cs786-
dc.description.abstractWe 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.extent29 pagesen_US
dc.language.isoen_USen_US
dc.titleOptimal Poker Strategies Under Collusion Simulating Fictitious Play in Simplified Poker Variantsen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2015en_US
pu.departmentComputer Scienceen_US
pu.pdf.coverpageSeniorThesisCoverPage-
Appears in Collections:Computer Science, 1988-2020

Files in This Item:
File SizeFormat 
PUTheses2015-Ullman_Robert.pdf706.81 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.