We consider a fundamental pricing problem in combinatorial auctions. We are given a set of
indivisible items and a set of buyers with randomly drawn monotone valuations over subsets …

In a prophet inequality problem, n independent random variables are presented to a
gambler one by one. The gambler decides when to stop the sequence and obtains the most …

We study new constructions aimed at strengthening the lower bound for the intersection of m
matroids prophet inequality. Current algorithms obtain at best O (m)-approximations while …