Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computer Science and Game Theory

arXiv:2301.01700 (cs)
[Submitted on 4 Jan 2023 (v1), last revised 8 Aug 2024 (this version, v2)]

Title:Non-Adaptive Prophet Inequalities for Minor-Closed Classes of Matroids

Authors:Kanstantsin Pashkovich, Alice Sayutina
View PDF HTML (experimental)
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.
Subjects: Computer Science and Game Theory (cs.GT)
Cite as: arXiv:2301.01700 [cs.GT]
  (or arXiv:2301.01700v2 [cs.GT] for this version)
  https://doi.org/10.48550/arXiv.2301.01700

Submission history

From: Kanstantsin Pashkovich [view email]
[v1] Wed, 4 Jan 2023 16:55:13 UTC (25 KB)
[v2] Thu, 8 Aug 2024 14:40:52 UTC (25 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.GT
< prev   |   next >
new | recent | 2023-01
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)