Problem
Research questions and friction points this paper is trying to address.
Matroid Secretary Conjecture
online algorithm
independence-oracle access
The Matroid Secretary Conjecture is True
🤖 AI Summary
本文解决了拟阵秘书问题，提出了一种在线算法，该算法在只知道元素数量和已到达元素子集独立性的情况下，以至少1/4的概率接受离线最优解的每个元素。
📝 Abstract
We resolve the matroid secretary conjecture, giving an online algorithm that accepts each element of the offline optimum with probability at least $1/4$. The algorithm only needs the number of elements in advance and independence-oracle access to subsets of already-arrived elements; it does not need to know the matroid upfront.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Matroid Secretary Conjecture
online algorithm
independence-oracle access
🔎 Similar Papers
2024-03-15arXiv.orgCitations: 2
