Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1, PDF p. 2 — the recursive k-choice secretary algorithm selects expected value ≥ (1 − 5/√k)·v

Proved
MultiChoiceSecretary.Alg.theorem_2_1

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

competitive-ratioonline-algorithmsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-ordersecretary-problem

Let SSS be any set of nnn non-negative real numbers, revealed one at a time in a uniformly random order, let k≥1k \ge 1k≥1 be the number of allowed selections, and let vvv be the sum of the kkk largest elements of SSS (all of SSS if k>nk > nk>n). Kleinberg's recursive algorithm uses the classical secretary rule for k=1k = 1k=1; for k≥2k \ge 2k≥2 it draws m∼B(n,1/2)m \sim B(n,1/2)m∼B(n,1/2), recursively selects up to ⌊k/2⌋\lfloor k/2\rfloor⌊k/2⌋ elements among the first mmm arrivals, and afterwards selects every arrival exceeding y⌊k/2⌋y_{\lfloor k/2\rfloor}y⌊k/2⌋​, the ⌊k/2⌋\lfloor k/2\rfloor⌊k/2⌋-th largest of the first mmm values, until kkk elements have been selected in total. Then the expected sum of the selected elements, over the random order and all internal coin tosses, satisfies

E[∑x selectedx]  ≥  (1−5k)v.\mathbb E\Big[\sum_{x \text{ selected}} x\Big] \;\ge\; \Big(1 - \frac{5}{\sqrt k}\Big)v.E[x selected∑​x]≥(1−k​5​)v.

This shows that the competitive ratio of the kkk-choice secretary problem tends to 111 as k→∞k \to \inftyk→∞, at rate 1−O(1/k)1 - O(1/\sqrt k)1−O(1/k​); it is the main result of the paper and the basis of its strategyproof online auction.

Formalization Note. When the first phase has seen fewer than ⌊k/2⌋\lfloor k/2\rfloor⌊k/2⌋ arrivals, the page leaves y⌊k/2⌋y_{\lfloor k/2\rfloor}y⌊k/2⌋​ undefined; the formalization reads it as −∞-\infty−∞, so every later arrival is selected until the cap. The cap of kkk counts the selections of both phases. For k≤25k \le 25k≤25 the right-hand side is ≤0\le 0≤0 and the claim is immediate; it is stated uniformly in kkk, as on the page.

Preamble
import Mathlib
import Definitions.Def_MultiChoiceSecretary_Alg_Setting
Formal statement
namespace MultiChoiceSecretary.Alg

theorem theorem_2_1 (S : Finset ℝ) (hS : ∀ x ∈ S, 0 ≤ x) (k : ℕ) (hk : 1 ≤ k) :
    (1 - 5 / Real.sqrt k) * topSum S k ≤ expectedValue S k := by sorry

end MultiChoiceSecretary.Alg
Source
Kleinberg, A multiple-choice secretary algorithm with applications to online auctions, SODA 2005, PDF p. 2, Theorem 2.1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me