Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01db78tf330
Full metadata record
DC FieldValueLanguage
dc.contributorSinai, Yakov-
dc.contributor.advisorRamadge, Peter-
dc.contributor.authorCao, Wesley-
dc.date.accessioned2015-06-15T15:20:05Z-
dc.date.available2015-06-15T15:20:05Z-
dc.date.created2015-05-04-
dc.date.issued2015-06-15-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp01db78tf330-
dc.description.abstractNearly all of the current literature on multi-armed bandits has been dedicated to maximizing the expected sum of samples from a set of distributions. However, it may be more desirable to prioritize risk management in some applications. In this thesis, we propose a new variant of the multi-armed bandit problem that is based on the Kelly Criterion, which derives motivation from portfolio optimization and exhibits desirable risk management properties. We introduce novel algorithms to solve this variant and prove theoretical bounds on the performance of theses algorithms.en_US
dc.format.extent39 pagesen_US
dc.language.isoen_USen_US
dc.titleAsymptotically Optimal Sequential Capital Allocation Strategiesen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2015en_US
pu.departmentMathematicsen_US
pu.pdf.coverpageSeniorThesisCoverPage-
Appears in Collections:Mathematics, 1934-2020

Files in This Item:
File SizeFormat 
PUTheses2015-Cao_Wesley.pdf271.13 kBAdobe PDF    Request a copy


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