Metraipolis › archive › dc_da1fb27cb999
A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities — arXiv:2609.20696
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20696
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T03:54:35.802Z
- SHA-256 of the archived text
f95625e3e67360cc665358edaf744beb5aec782dec83e29431be05921ef61069- Stable URL of this page
https://metraipolis.com/documento/dc_da1fb27cb999
How to cite
A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities — arXiv:2609.20696 — arXiv (en), https://arxiv.org/abs/2609.20696 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da1fb27cb999 (Metraipolis archive dc_da1fb27cb999, sha256 f95625e3e67360cc665358edaf744beb5aec782dec83e29431be05921ef61069)
BibTeX
@misc{dcda1fb27cb999,
title = {A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities — arXiv:2609.20696},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20696},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da1fb27cb999; sha256 f95625e3e67360cc665358edaf744beb5aec782dec83e29431be05921ef61069},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20696. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study prophet inequalities under intersections of $q$ partition matroids, where an online algorithm irrevocably selects elements with independent nonnegative values drawn from known distributions and revealed in an adversarial order. We prove an $\Omega(q/\log q)$ lower bound on the competitive ratio. Together with the known $O(q)$ upper bounds, this resolves, up to a logarithmic factor, the optimal dependence on $q$, an open question posed by Correa, Cristi, Fielbaum, Pollner, and Weinberg (IPCO 2022) and Saxena, Velusamy, and Weinberg (ITCS 2023). Our construction also yields an $\Omega(d/\log d)$ lower bound for $d$-single-minded auctions, where buyers request fixed bundles of at most $d$ unit-capacity items. Our construction and analysis build on the "big-decisions-first" framework of Rubinstein and Singla (STOC 2026). Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-18 in cs.GT). Categorie arXiv: Computer Science and Game Theory (cs.GT). Pagina del lavoro: https://arxiv.org/abs/2609.20696 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T03:25:20.235Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).