scientific article; zbMATH DE number 7650408

DOI10.4230/LIPICS.ITCS.2020.60MaRDI QIDQ5875764zbMATH OpenFDO

Authors Aviad Rubinstein, Jack Z. Wang, S. Matthew Weinberg

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1911.07945

zbMATH Keywords

auctionsonline algorithmsoptimizationprobabilityprophet inequalitiessamples

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(15)

• The secretary problem with distributions
• Prophet secretary through blind strategies
• Prophet inequalities for independent and identically distributed random variables from an unknown distribution
• Optimal prophet inequality with less than one sample
• A constant factor prophet inequality for online combinatorial auctions
• Order-competitive ratio
• Efficient two-sided markets with limited information
• Competitive analysis with a sample and the secretary problem
• Single sample prophet inequality for uniform matroids of rank 2
• IID prophet inequality with a single data point
• Pairwise-independent contention resolution
• Sequencing stochastic jobs with a single sample
• Online combinatorial assignment in independence systems
• Pairwise-independent contention resolution
• The last success problem with samples

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875764)