Metraipolis › archive › dc_9705067cb8aa

A 3.1462-Competitive Algorithm for Matroid Secretary — arXiv:2609.17782

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.17782
License (as archived)
CC0-1.0
Archived
2026-10-15T14:08:41.733Z
SHA-256 of the archived text
3726622e2c7e22ad8c5fb498c14e4c5a5b9d4867743d8446b95cff45242bd467
Stable URL of this page
https://metraipolis.com/documento/dc_9705067cb8aa

How to cite

A 3.1462-Competitive Algorithm for Matroid Secretary — arXiv:2609.17782 — arXiv (en), https://arxiv.org/abs/2609.17782 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9705067cb8aa (Metraipolis archive dc_9705067cb8aa, sha256 3726622e2c7e22ad8c5fb498c14e4c5a5b9d4867743d8446b95cff45242bd467)
BibTeX
@misc{dc9705067cb8aa,
  title = {A 3.1462-Competitive Algorithm for Matroid Secretary — arXiv:2609.17782},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.17782},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9705067cb8aa; sha256 3726622e2c7e22ad8c5fb498c14e4c5a5b9d4867743d8446b95cff45242bd467},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.17782. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The matroid secretary problem asks an online algorithm to select a high-weight independent set from elements arriving in uniformly random order, with immediate and irrevocable decisions. Singla (2026) recently gave a $4$-competitive algorithm for arbitrary matroids using only the number of elements and independence queries on already-arrived elements. Following his approach of maintaining a dynamically updated reference set, we introduce random deletions and a time-dependent acceptance rule, improving the competitive ratio to $C_*\approx3.1462$ in the same information model, where $C_*-\log C_*=2$. Our ordinal algorithm accepts every element of a fixed canonical optimum with probability exactly $1/C_*$ and uses $O(n^2)$ independence queries. The algorithm maintains a greedy reference solution, protects only accepted elements, and randomly deletes unaccepted reference-basis elements. A time-dependent acceptance rule makes the accepted set, conditional on the reference set, an independent thinning of its greedy basis. The resulting guarantee has a direct analytic proof.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-17 in cs.GT).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2609.17782 — 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-15T13:50:52.130Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).