We show that a simple greedy algorithm is $4.75$ probability-competitive for the Laminar Matroid Secretary Problem, improving the $3\sqrt{3} \approx 5.196$-competitive algorithm based on the forbidden sets technique (Soto, Turkieltaub, and Verdugo, 2018).

翻译：我们证明，对于层状拟阵秘书问题，一个简单的贪心算法具有$4.75$的概率竞争比，该结果改进了基于禁止集技术（Soto, Turkieltaub和Verdugo, 2018）的$3\sqrt{3} \approx 5.196$竞争比算法。