解决拟阵秘书问题

中文摘要 AI 辅助

本文通过一个 $e$-概率竞争算法解决了拟阵秘书问题。该算法是序数的，仅通过比较和独立性预言机访问到达的元素，并具有期望多项式时间和预言机复杂度。

英文摘要

This paper settles the Matroid Secretary Problem with an $e$-probability-competitive algorithm. The algorithm is ordinal and accesses arrived elements only through comparison and independence oracles, and has expected polynomial time and oracle complexity.

发表机构

• The University of Hong Kong（香港大学）

机构由 AI 辅助整理，请以论文原文为准。