2000 character limit reached
Non-Adaptive Prophet Inequalities for Minor-Closed Classes of Matroids
Published 4 Jan 2023 in cs.GT | (2301.01700v2)
Abstract: We consider the matroid prophet inequality problem. This problem has been extensively studied in the case of adaptive mechanisms. In particular, there is a tight $2$-competitive mechanism for all matroids. However, it is not known what classes of matroids admit non-adaptive mechanisms with constant guarantee. Recently, it was shown that there are constant-competitive non-adaptive mechanisms for graphic matroids. In this work, we show that various known classes of matroids admit constant-competitive non-adaptive mechanisms.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.