Skip to main content

Optimal Single-Choice Prophet Inequalities from Samples

Author(s): Rubinstein, Aviad; Wang, Jack Z; Weinberg, S Matthew

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1c83s
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRubinstein, Aviad-
dc.contributor.authorWang, Jack Z-
dc.contributor.authorWeinberg, S Matthew-
dc.date.accessioned2021-10-08T19:49:40Z-
dc.date.available2021-10-08T19:49:40Z-
dc.date.issued2020en_US
dc.identifier.citationRubinstein, Aviad, Jack Z. Wang, and S. Matthew Weinberg. "Optimal Single-Choice Prophet Inequalities from Samples." In 11th Innovations in Theoretical Computer Science Conference (ITCS) (2020): pp. 60:1-60:10. doi:10.4230/LIPIcs.ITCS.2020.60en_US
dc.identifier.issn1868-8969-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1c83s-
dc.description.abstractWe study the single-choice Prophet Inequality problem when the gambler is given access to samples. We show that the optimal competitive ratio of 1/2 can be achieved with a single sample from each distribution. When the distributions are identical, we show that for any constant ε > 0, O(n) samples from the distribution suffice to achieve the optimal competitive ratio (≈ 0.745) within (1+ε), resolving an open problem of [José R. Correa et al., 2019].en_US
dc.format.extent60:1 - 60:10en_US
dc.language.isoen_USen_US
dc.relation.ispartof11th Innovations in Theoretical Computer Science Conferenceen_US
dc.rightsFinal published version. This is an open access article.en_US
dc.titleOptimal Single-Choice Prophet Inequalities from Samplesen_US
dc.typeConference Articleen_US
dc.identifier.doi10.4230/LIPIcs.ITCS.2020.60-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
OptSingleChoiceSamples.pdf458.97 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.