Prophet Secretary Against the Online Optimal-Reference-Cited by-同舟云学术

Prophet Secretary Against the Online Optimal

Published:2023-07-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 24th ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Dütting Paul¹^ORCID,Gergatsouli Evangelia²^ORCID,Rezvan Rojin³^ORCID,Teng Yifeng⁴^ORCID,Tsigonias-Dimitriadis Alexandros⁵^ORCID

Affiliation:

1. Google Research, Zurich, Switzerland

2. University of Wisconsin - Madison, Madison, Wisconsin, USA

3. University of Texas at Austin, Austin, Texas, USA

4. Google Research, New York, New York, United States

5. Universidad de Chile, Santiago, Chile

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3580507.3597736

Reference46 articles.

1. On Optimal Ordering in the Optimal Stopping Problem

2. Saeed Alaei . Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers . In FOCS'11: The 52nd IEEE Symposium on Foundations of Computer Science , Palm Springs, CA, USA, pages 512--521 , 2011 . Saeed Alaei. Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In FOCS'11: The 52nd IEEE Symposium on Foundations of Computer Science, Palm Springs, CA, USA, pages 512--521, 2011.

3. Nima Anari , Rad Niazadeh , Amin Saberi , and Ali Shameli . Nearly optimal pricing algorithms for production constrained and laminar bayesian selection . In EC'19: The 20th ACM Conference on Economics and Computation , Phoenix, AZ, USA. ACM , 2019 . Nima Anari, Rad Niazadeh, Amin Saberi, and Ali Shameli. Nearly optimal pricing algorithms for production constrained and laminar bayesian selection. In EC'19: The 20th ACM Conference on Economics and Computation, Phoenix, AZ, USA. ACM, 2019.

4. Yossi Azar , Ashish Chiplunkar , and Haim Kaplan . Prophet secretary : Surpassing the 1-1/e barrier . In EC'18: The 19th ACM Conference on Economics and Computation , Ithaca, NY, USA, pages 303--318 , 2018 . Yossi Azar, Ashish Chiplunkar, and Haim Kaplan. Prophet secretary: Surpassing the 1-1/e barrier. In EC'18: The 19th ACM Conference on Economics and Computation, Ithaca, NY, USA, pages 303--318, 2018.