Beating 1-1/e for ordered prophets-Reference-Cited by-同舟云学术

Beating 1-1/e for ordered prophets

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Abolhassani Melika¹,Ehsani Soheil¹,Esfandiari Hossein¹,HajiAghayi MohammadTaghi¹,Kleinberg Robert²,Lucier Brendan³

Affiliation:

1. University of Maryland at College Park, USA

2. Cornell University, USA

3. Microsoft Research, USA

Funder

DARPA SIMPLEX grant

NSF CAREER award

DARPA GRAPHS-AFOSR grant

Medium grant

NSF BIGDATA grant

NSF award

Publisher

ACM

Link

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

Reference44 articles.

1. S. Alaei. 2011. Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In FOCS. 10.1109/FOCS.2011.90 S. Alaei. 2011. Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In FOCS. 10.1109/FOCS.2011.90

2. Saeed Alaei MohammadTaghi Hajiaghayi and Vahid Liaghat. 2012. Saeed Alaei MohammadTaghi Hajiaghayi and Vahid Liaghat. 2012.

3. Online prophet-inequality matching with applications to ad allocation. In EC. Online prophet-inequality matching with applications to ad allocation. In EC.

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Prophet Inequalities with Cancellation Costs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Matroid Bayesian Online Selection;Lecture Notes in Computer Science;2024

3. Prophet Inequalities with Linear Correlations and Augmentations;ACM Transactions on Economics and Computation;2023-12-19

4. The Competition Complexity of Dynamic Pricing;Mathematics of Operations Research;2023-10-20

5. Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities;Mathematics of Operations Research;2023-08-09