On the Strong Matroid Secretary Conjecture and Beyond

Abstract: The strong matroid secretary conjecture asserts that every matroid admits a $1/e$-competitive secretary algorithm, matching the classical single-choice guarantee. We formulate a finite linear program whose value is the optimal ordinal competitive ratio of any fixed matroid; for all matroids of positive rank on seven elements and nearly all on eight, this value exceeds $1/e$. The same computations suggested that the optimal ratio is monotone under truncation of the matroid; we prove this for uniform matroids, where the ratio is strictly increasing in the rank, and refute it for a graphic matroid. Guided by this evidence, we prove the conjecture for every linear matroid, a class that includes graphic matroids, regular matroids, laminar matroids, and gammoids, giving a $1/e$-competitive ordinal secretary algorithm. The algorithm maintains bounds on the expected intersection dimension of the accepted span with every ambient subspace. Uncrossing and separation show that these bounds can be preserved while admitting each current greedy-basis element with a prescribed probability and the construction uses finite linear programs. For every matroid, we also give a single-sample prophet algorithm with competitive ratio $1/2$ in any fixed arrival order independent of the samples and values. Its output, including the selected values, has exactly the law of an independent fair thinning of an optimum from a fresh product draw. The algorithm uses $O(n<sup>2)$ independence queries on $n$ elements. Both constants are tight in their respective models. We also give a self-contained black-box reduction that converts a single-sample prophet ratio $α$ into a secretary ratio $α<sup>2/16$, preserving polynomial running time. Our single-sample algorithm consequently yields a $1/64$-competitive ordinal secretary algorithm for arbitrary matroids.

• The paper establishes an Online secretary algorithm approach for the strong matroid secretary conjecture, demonstrating ordinal algorithms competitive ratios.
• The authors discovers a single-sample prophet inequality with an optimal determination of calculating selection probabilities, and approaches algorithm feasibility via distributing a weight order.
• They develops a reduction from a prophet algorithm to a secretary algorithm with a linear prophet competitive bound, leading to polynomial-time complexity.

Problem setting and principal claims

The paper studies two closely related online selection models over matroids. In the matroid secretary problem, an adversary fixes nonnegative element weights, the elements arrive in a uniformly random order, and the algorithm must accept or reject each element irrevocably while maintaining independence. An ordinal algorithm observes only the relative order of revealed weights. The central conjecture is that every matroid admits an ordinal secretary algorithm with competitive ratio $1/e$, matching the optimal rank-one secretary constant.

The paper establishes three main results.

First, it proves the strong matroid secretary conjecture for every linear matroid. For a linear matroid, every element of the offline greedy basis is selected with exactly the same probability as the classical secretary algorithm selects the maximum element under a cutoff rule. Consequently, the expected weight of the online independent set is at least $1/e$ times the optimum. This covers graphic, cographic, regular, transversal, laminar, and gammoid matroids.

Second, for arbitrary matroids, it gives a single-sample prophet inequality with the optimal ratio $1/2$. The result is distributionally exact: the selected labeled values have the law of an independent fair thinning of the optimum basis from an independent fresh draw. The algorithm uses only $O(n^2)$ independence-oracle queries.

Third, it gives a self-contained reduction from an $\alpha$-competitive single-sample prophet algorithm to an $\alpha^2/16$-competitive secretary algorithm. Instantiating $\alpha=1/2$ yields a polynomial-time, ordinal $1/64$-competitive secretary algorithm for every matroid. Thus the paper proves the previously unresolved existence of a constant competitive ratio for general matroids, although its optimal $1/e$ guarantee is established only for linear matroids.

An exact finite linear program for ordinal policies

A central methodological contribution is a finite linear program whose optimum equals the optimal ordinal competitive ratio $\rho(M)$ of any fixed matroid. Since an ordinal policy depends on the weight vector only through the induced strict weight order, the program indexes states by:

• the observed set together with its relative weight order;
• the currently accepted independent set;
• the transition taken when the next element arrives.

Flow variables encode the probability of reaching each state, while acceptance and rejection variables encode transitions. Feasibility constraints prohibit dependent acceptances. Competitive-ratio constraints are imposed for every prefix of every possible weight order.

The prefix formulation is equivalent to the usual weighted formulation. If $1/e$0 is a prefix of the greedy weight order, an ordinal policy with expected accepted cardinality at least $1/e$1 on every such prefix is $1/e$2-competitive for every nonnegative weight vector. This follows from the layer-cake or summation-by-parts representation of both the online value and the offline greedy optimum.

The exactness theorem is stronger than a mere upper-bound relaxation. Every feasible LP solution induces an ordinal policy depending only on the current observed weight order, arriving label, and accepted set. Conversely, every ordinal policy induces a feasible LP solution. The supremum defining $1/e$3 is therefore attained by a finite-state policy of this form.

The authors solved this LP for all positive-rank matroids on seven elements and nearly all such matroids on eight elements. In every computed instance, the optimal ratio exceeded $1/e$4. They also report that, except for the rank-one matroid itself, every examined matroid had a ratio strictly larger than the rank-one ratio on the same ground-set size. These computations motivated the search for a structural proof of the strong conjecture.

The computational evidence also led to a truncation conjecture: that $1/e$5 should be nondecreasing with the truncation rank $1/e$6. The paper proves strict monotonicity for uniform matroids, but refutes it for graphic matroids. Specifically, for the cycle matroid of $1/e$7 with $1/e$8,

$1/e$9

The rank-three truncation is uniform because $1/2$0 has no cycles of length at most three, and its ratio exceeds $1/2$1. In contrast, the unrestricted graphic matroid has ratio below $1/2$2. This counterexample shows that increasing matroid rank need not make the ordinal secretary problem easier, and it rules out a direct proof of the strong conjecture through truncation monotonicity. The upper bound even permits algorithms to observe numerical weights, so the failure is not an artifact of ordinal information.

The linear-matroid secretary algorithm

The paper’s main structural theorem concerns linear matroids represented by vectors $1/2$3 over a finite field. The algorithm uses a cutoff $1/2$4: the first $1/2$5 arrivals are rejected, and subsequent arrivals that belong to the current greedy basis are admitted with a carefully designed state-dependent randomization.

The desired acceptance probability for a greedy-basis candidate arriving at time $1/2$6 is

$1/2$7

If this probability could always be used whenever the candidate is available, then an element of the offline greedy basis would be selected with probability

$1/2$8

This is exactly the success probability of the classical rank-one cutoff algorithm. The difficulty in higher-rank matroids is that a candidate can be blocked by the span of previously accepted elements even when few elements have been accepted.

The key invariant controls the accepted span simultaneously in every ambient subspace. Let $1/2$9 denote the span of the accepted vectors. For every subspace $O(n^2)$0 of the representation space, the algorithm maintains

$O(n^2)$1

after $O(n^2)$2 arrivals. The line constraint associated with a candidate vector implies that the candidate is blocked with probability at most $O(n^2)$3, leaving precisely the amount of free probability mass required for the next acceptance quota.

The use of all subspaces, rather than only lines generated by ground elements, is essential. Constraints on individual candidate lines control immediate availability but do not propagate under vector-space extensions. The algorithm must also control subspaces formed by combinations of represented vectors that need not themselves be generated by a ground subset.

The feasibility proof has two components. For a chain of subspaces, the states in which adding a candidate increases the load are nested. Therefore, the algorithm can allocate acceptance mass to the least expensive states in an order that simultaneously preserves all constraints in the chain. For an arbitrary collection of subspaces, the paper applies an uncrossing argument: incomparable subspaces are replaced by their intersection and sum. This preserves the total dimension budget and weakly increases the relevant intersection loads. Repeated uncrossing reduces every priced family of constraints to a chain. A separation or minimax argument then yields a single transition satisfying all subspace inequalities simultaneously.

The recursion is implemented by finite linear programs associated with every observed set and relative weight order. When an element arrives, the algorithm computes a transition distribution and accepts according to the conditional mass assigned to the transition that adds that element. The construction is finite and exact, but no polynomial running-time bound is claimed. Even obtaining a finite-field representation may require exhaustive search when only a matroid oracle or independence relation is supplied.

For every weight vector and every element $O(n^2)$4 of the full greedy basis $O(n^2)$5, the algorithm selects $O(n^2)$6 with probability exactly $O(n^2)$7. Hence it satisfies a probability-competitive guarantee, stronger than merely obtaining the appropriate expected total weight. Every greedy prefix receives the same per-element selection probability, and summation by parts converts these prefix guarantees into

$O(n^2)$8

The cutoff can be chosen so that $O(n^2)$9 for every $\alpha$0. Therefore:

Every linear matroid admits an ordinal $\alpha$1-competitive secretary algorithm.

The constant is tight in the universal sense because rank-one matroids are included, and the classical secretary problem cannot guarantee more than $\alpha$2 asymptotically, even with numerical weight observations.

Scope of the linear-matroid theorem

The theorem applies to a broad class of matroids. In particular, it includes graphic and cographic matroids, regular matroids, transversal matroids, laminar matroids, and gammoids. For graphic matroids, this improves the previously known guarantee approaching $\alpha$3 only under additional girth conditions and establishes the exact universal constant for the entire class.

The result is notable for its proof mechanism. It does not reduce the problem to the number of accepted elements, nor does it rely on a monotonicity statement under matroid truncation. Instead, it constructs a distribution over independent accepted sets whose span is fractionally bounded in every subspace. The uniform random arrival order enters critically in the extension argument: after conditioning on the observed set, the last arriving element is uniformly distributed, and the greedy candidates form an independent set whose intersection with any subspace has cardinality at most its dimension.

The result should nevertheless be distinguished from an efficient algorithmic theorem. The construction enumerates all subspaces over a finite field and solves a potentially enormous collection of finite linear programs. The paper proves computability in a finite sense, not polynomial-time implementability. The polynomial general-matroid guarantee established later therefore has a different status: it is weaker in ratio but stronger in computational complexity.

A tight single-sample prophet inequality

The second major result concerns a matroid prophet model. Each element $\alpha$4 has an independent nonnegative value $\alpha$5 drawn from an unknown distribution. Before arrivals, the algorithm receives one independent sample from each distribution. The arrival order may be any fixed order independent of the samples and realized values.

The algorithm maintains a stored vector $\alpha$6, initially equal to the sample vector, and a greedy basis $\alpha$7. When the actual value of an element arrives, the algorithm may replace the stored coordinate by the actual value. The replacement probability depends on whether the element enters the new greedy basis and whether the displaced element has already been accepted or rejected.

The central invariant is exact rather than approximate. After every arrival prefix, conditional on the stored vector, the accepted set is an independent fair thinning of the processed portion of the stored greedy basis. Simultaneously, the stored vector retains the original product distribution. The proof couples the sample and actual value of each coordinate as an unordered pair with a hidden fair orientation bit. Replacing the stored coordinate flips this bit, allowing the algorithm to preserve both the product distribution and the thinning invariant.

The exchange structure of matroid greedy bases is decisive. Changing one coordinate can cause at most one basis exchange. If an arriving element displaces an already accepted element, the replacement is prohibited. If it displaces an already rejected element, replacement occurs with probability one. If the displaced element has not yet arrived, a fair coin is used. These cases preserve the joint distribution of the basis membership and acceptance indicators.

At termination, the paper proves the distributional identity

$\alpha$8

where $\alpha$9 is an independent fresh product draw, $\alpha^2/16$0 is obtained by independently retaining each element of the greedy basis $\alpha^2/16$1 with probability $\alpha^2/16$2, and $\alpha^2/16$3 is the algorithm’s output. Consequently,

$\alpha^2/16$4

The guarantee is exact at the level of expected value, not merely a lower bound produced by a charging argument. The algorithm performs at most $\alpha^2/16$5 greedy scans and therefore uses $\alpha^2/16$6 independence queries.

The factor $\alpha^2/16$7 is optimal even in rank one. A two-element instance with one deterministic value equal to $\alpha^2/16$8 and a second value equal to $\alpha^2/16$9 with probability $\alpha=1/2$0 forces any algorithm, even one that knows the distributions, to obtain expected value asymptotically at most $\alpha=1/2$1, whereas the prophet obtains expected value approaching $\alpha=1/2$2. Thus no uniform single-sample prophet ratio greater than $\alpha=1/2$3 is possible.

Reduction from prophet inequalities to secretary algorithms

The paper then converts the single-sample prophet result into a secretary guarantee for arbitrary matroids. A direct approach would use an initial rejected prefix as the prophet samples, but this creates an implementation problem: the simulated prophet algorithm may later select an element from the rejected prefix, which cannot be accepted in the physical secretary process.

The reduction resolves this through three steps.

First, a random half-sample is rejected and used to filter the remaining elements. An element is retained as eligible if it is not spanned by the earlier sampled elements in the greedy weight order. If $\alpha=1/2$4 denotes the eligible set, then

$\alpha=1/2$5

The first inequality controls the total weight that can be lost through unimplementable selections; the second ensures that a constant fraction of the optimum remains available.

Second, each eligible element is activated independently with probability $\alpha=1/2$6. The simulated prophet sample and actual value are independently activated versions of the element’s secretary weight. A useful prophet selection has expected contribution linear in $\alpha=1/2$7, whereas an unimplementable selection requires both sample and actual activation and therefore incurs only a quadratic $\alpha=1/2$8 loss.

Third, the reduction interleaves the stored sample prefix with the physical arrivals. The resulting simulated arrival order is uniform and independent of the activation bits, exactly satisfying the prophet algorithm’s order requirement. The coupling is exact, not an approximation based on asymptotic random-order arguments.

The resulting guarantee is

$\alpha=1/2$9

Choosing $1/64$0 gives an $1/64$1 secretary ratio. For $1/64$2, the paper obtains:

Every matroid admits a polynomial-time ordinal $1/64$3-competitive secretary algorithm.

The reduction preserves ordinal information because all comparisons used by the simulated prophet algorithm are comparisons among already revealed secretary weights, artificial zeros, and fixed tie priorities. It requires only an independence oracle and polynomial bookkeeping.

The $1/64$4 constant is not claimed to be optimal. It is the product of the tight $1/64$5 prophet ratio with losses introduced by the generic reduction. In particular, the paper explicitly contrasts this result with an independent concurrent result giving a $1/64$6 general-matroid secretary guarantee, while emphasizing that the present work obtains the optimal $1/64$7 constant for linear matroids and the tight $1/64$8 single-sample prophet constant.

Limitations and open questions

The strongest limitation is computational. The $1/64$9 algorithm for linear matroids is finite but potentially non-polynomial: it enumerates subspaces and solves recursively defined linear programs. The theorem therefore establishes the conjectured ratio as an information-theoretic and constructive existence result, not as an efficient oracle algorithm.

For arbitrary matroids, the polynomial algorithm achieves only $1/e$0, leaving a substantial gap between the general guarantee and the $1/e$1 lower bound conjectured for every matroid. The paper does not establish whether the strong conjecture holds for non-linear matroids. Since almost all matroids are non-linear in the enumerative sense, the distinction between the linear and general cases is mathematically significant rather than merely technical.

The exact LP for $1/e$2 is also primarily a computational and structural tool. Its size grows superexponentially without substantial symmetry and state reductions, and it does not itself imply a uniform lower bound over all matroids. The computational experiments support the strong conjecture but cannot substitute for a proof in the non-linear case.

Finally, truncation monotonicity fails even for graphic matroids, so rank-based induction cannot provide a general route to the conjecture. The paper leaves open whether there is a different structural invariant for arbitrary matroids that can replace the subspace-load invariant used in the linear case, or whether the $1/e$3 conjecture requires techniques fundamentally different from those developed here.

Conclusion

The paper resolves several distinct questions about matroid online selection. It proves the strong $1/e$4 secretary guarantee for all linear matroids through a subspace-sensitive span invariant, establishes the optimal $1/e$5 single-sample prophet inequality for arbitrary matroids with an exact fair-thinning distributional identity, and derives a polynomial-time $1/e$6 ordinal secretary algorithm for every matroid. Its finite LP characterization and truncation counterexample further clarify the structure of ordinal matroid secretary ratios. The main unresolved issue is whether the $1/e$7 guarantee extends from linear to arbitrary, potentially non-representable matroids.