Oblivious Bipartite Matching

• Oblivious bipartite matching is a framework where algorithms commit to matching edges with only partial graph information using fixed non-adaptive rules.
• It leverages methods like the weighted Ranking algorithm that guarantee a 1-1/e competitive ratio via randomized primal–dual analyses and gain-sharing techniques.
• Advanced approaches such as Quadratic Ranking break the standard barrier, achieving up to a 0.659-competitive guarantee even in distribution-free settings.

Oblivious bipartite matching denotes a family of matching models in which decisions are made without full knowledge of the realized graph, without access to future arrivals, or according to a fixed non-adaptive rule. In its standard contemporary form, the algorithm knows the bipartition $L \cup R$ and, in weighted variants, all pair weights $w_{uv}$, but does not know which pairs are actual edges until they are probed; under the query-commit rule, a successful probe must be accepted irrevocably (Tang et al., 2020). In adjacent literatures, the term also appears in the phrases oblivious algorithm, referring to a rule that ignores the current matching state when choosing a neighbor, and oblivious adversary, referring to an adversary that fixes the request sequence before seeing the algorithm’s random choices (Mastin et al., 2013, 0705.4673). A further, more algebraic usage concerns fixed evaluation schedules that are chosen independently of the input graph (Du, 2 Apr 2026). This suggests a unifying theme: algorithmic commitment under restricted information.

1. Core formulations and terminological scope

In the edge-weighted oblivious matching problem on bipartite graphs, the input consists of vertex sets $L$ and $R$, an unknown edge set $E \subseteq L \times R$, and known non-negative weights $w_{uv}$ for all pairs $(u,v)$. An adversary fixes the entire graph before the algorithm runs but reveals only the vertices. The algorithm can discover whether $(u,v)\in E$ only by probing $(u,v)$. If both endpoints are unmatched and the probe succeeds, the edge must be added irrevocably to the matching; otherwise nothing happens. The objective is to maximize the expected weight of the produced matching, compared with the maximum-weight matching $W^*$ in the realized graph (Tang et al., 2020).

This model is a strict generalization of stochastic bipartite matching. In the stochastic formulation, each potential edge $w_{uv}$0 has a weight $w_{uv}$1 and an existence probability $w_{uv}$2, and edge existences are independent. Any oblivious-matching algorithm can be run in that setting by ignoring the $w_{uv}$3 values and treating the realized graph as an unknown fixed graph. Because the analysis in the weighted Ranking paper does not use independence or the probabilities at all, its guarantee carries over even when stochastic edge existences are arbitrarily correlated (Tang et al., 2020).

A related but not identical usage occurs in online bipartite matching. There, the offline side $w_{uv}$4 is known initially, online vertices arrive one by one, and the algorithm must match or discard each arrival immediately and irrevocably. In that literature, “oblivious” is often used informally to mean that the algorithm acts without knowledge of future arrivals; the lossless-rounding work explicitly treats the online setting as the relevant notion of obliviousness and contrasts it with fully informed offline matching (Buchbinder et al., 2021).

The phrase also appears in average-case analyses of a specific online rule called oblivious: when a ball $w_{uv}$5 arrives in $w_{uv}$6, the algorithm chooses a uniformly random neighbor from $w_{uv}$7 without regard to whether that bin is already matched; if the chosen bin is occupied, the attempt fails and the ball is dropped (Mastin et al., 2013). By contrast, in metric online matching the distinction is often not between oblivious and adaptive algorithms, but between an oblivious adversary and an adaptive adversary. The randomized metric algorithm of Meyerson, Nanavati, and Poplawski is analyzed against an oblivious adversary, whereas the deterministic RM-Algorithm on the line is analyzed against an adaptive adversary (0705.4673, Raghvendra, 2018).

2. Query-commit matching and the $w_{uv}$8 Ranking paradigm

A central baseline for oblivious bipartite matching is the weighted Ranking algorithm. Each $w_{uv}$9 draws an independent rank

$L$0

and the algorithm uses

$L$1

For each pair $L$2, it defines the perturbed weight

$L$3

sorts all pairs in descending order of $L$4, and probes them in that order. If either endpoint is already matched, the pair is skipped; otherwise the probe is executed, and a successful probe is committed immediately (Tang et al., 2020).

The main guarantee is that weighted Ranking is $L$5-approximate for the edge-weighted oblivious matching problem on bipartite graphs. Formally, for every fixed graph $L$6 and arbitrary non-negative edge weights,

$L$7

The same algorithm is therefore also $L$8-approximate for stochastic bipartite matching, even with arbitrary correlation between edge-existence events, because the proof does not use the probabilities $L$9 at all (Tang et al., 2020).

The analysis is randomized primal–dual. For every matched edge $R$0, the gain-sharing rule sets

$R$1

with $R$2 on unmatched vertices. Hence $R$3 on each matched edge, so the dual objective equals the algorithm’s matching weight. The core technical step is to show that for every relevant edge $R$4,

$R$5

The proof combines a monotonicity lemma, a marginal-rank threshold $R$6, a basic gain lemma, and a bipartite-specific extra-gain lemma based on an alternating-path comparison. With the choice $R$7, the integral

$R$8

collapses to $R$9, independently of $E \subseteq L \times R$0 (Tang et al., 2020).

This $E \subseteq L \times R$1 guarantee became the canonical benchmark for the edge-weighted oblivious model. It also clarified a structural fact: the bipartite hypothesis enters exactly at the extra-gain step. The paper explicitly identifies this as the point where the stronger bipartite guarantee is obtained; by comparison, the best known edge-weighted oblivious algorithm for general graphs in the cited prior work achieved only $E \subseteq L \times R$2 (Tang et al., 2020).

3. Quadratic Ranking and the first distribution-free improvement beyond $E \subseteq L \times R$3

A subsequent development breaks the $E \subseteq L \times R$4 barrier in the distribution-free oblivious model. “Edge-weighted Matching in the Dark” studies Oblivious Bipartite Matching as a worst-case, probability-free counterpart of Query-Commit Matching and presents a $E \subseteq L \times R$5-competitive polynomial-time algorithm called Quadratic Ranking (Huang et al., 25 Jul 2025).

Quadratic Ranking assigns an independent random rank

$E \subseteq L \times R$6

to every vertex $E \subseteq L \times R$7. It is parameterized by two functions $E \subseteq L \times R$8 such that $E \subseteq L \times R$9 is non-increasing, right-continuous, strictly positive on $w_{uv}$0, and satisfies $w_{uv}$1; $w_{uv}$2 is non-decreasing, right-continuous, and strictly positive on $w_{uv}$3; and for all $w_{uv}$4,

$w_{uv}$5

The perturbed weight of an edge is

$w_{uv}$6

and the algorithm queries edges in descending order of $w_{uv}$7. If edge $w_{uv}$8 is matched, the dual variables satisfy

$w_{uv}$9

This decouples edge priority and gain-sharing while preserving a primal–dual certificate (Huang et al., 25 Jul 2025).

A structural theorem explains why these expressions are quadratic. In a general perturbed-greedy framework with a ranking function $(u,v)$0 and a share function $(u,v)$1, if one assumes symmetry of priorities, Rank–Share consistency, and preference consistency, then there exist univariate functions $(u,v)$2 such that

$(u,v)$3

Conversely, any such pair satisfies the three axioms. In that sense, the quadratic form is not merely convenient; it is the unique form compatible with the stated consistency properties (Huang et al., 25 Jul 2025).

The paper proves a $(u,v)$4-competitive guarantee for Oblivious Bipartite Matching and therefore also for Query-Commit Bipartite Matching, even when edge realizations are arbitrarily correlated. It also gives a closed-form analytic choice

$(u,v)$5

with $(u,v)$6, $(u,v)$7, and $(u,v)$8, yielding $(u,v)$9, which already exceeds $(u,v)\in E$0. The final $(u,v)\in E$1 ratio is obtained by discretizing $(u,v)\in E$2 and $(u,v)\in E$3 into step functions, reducing the lower-bound optimization to a quadratically constrained quadratic program, and then verifying a hand-designed 13-step solution (Huang et al., 25 Jul 2025).

The same work sharpens upper bounds as well. For unweighted oblivious matching, it proves that no bipartite algorithm can achieve a competitive ratio strictly larger than $(u,v)\in E$4, and no general-graph algorithm can achieve a competitive ratio strictly larger than $(u,v)\in E$5. These hardness results improve the previously cited upper bounds of $(u,v)\in E$6 in the bipartite case and $(u,v)\in E$7 in the general-graph case (Huang et al., 25 Jul 2025).

4. Online, fractional, and polyhedral perspectives

A different research line studies online bipartite matching under arrival uncertainty and asks when fractional online algorithms can be rounded without loss. The bipartite fractional matching polytope is integral offline, but Devanur et al. showed that general online lossless rounding is impossible. The 2021 lossless-rounding paper responds by imposing additional non-convex constraints on the fractional process. For a two-choice fractional algorithm with $(u,v)\in E$8, soundness is defined by

$(u,v)\in E$9

where $(u,v)$0. Under this condition, there exists an online randomized algorithm whose output matching $(u,v)$1 satisfies

$(u,v)$2

If the fractional algorithm is maximal, the rounding is implementable in poly-time (Buchbinder et al., 2021).

This framework produces integral online algorithms with the same competitive ratios as the underlying fractional solutions. The paper reports $(u,v)$3 for unweighted matching and $(u,v)$4 for vertex-weighted matching. It also establishes the threshold

$(u,v)$5

random or advice bits as both necessary and sufficient to achieve a competitive ratio of $(u,v)$6 for online vertex-weighted bipartite matching. In the same framework, an optimal $(u,v)$7 semi-OCS is obtained via lossless online rounding (Buchbinder et al., 2021).

In the known i.i.d. model, dynamic relaxations refine the set of achievable matching probabilities. Let $(u,v)$8 denote the probability that type $(u,v)$9 is matched to ad $W^*$0 at stage $W^*$1. The basic dynamic relaxation uses the constraints

$W^*$2

and

$W^*$3

which are facet-defining for the achievable-probability polytope $W^*$4. The paper shows that these time-indexed constraints dominate the static max-flow relaxation with right-star inequalities, and it derives heuristic policies from the corresponding dual prices. The online decision rule becomes

$W^*$5

which is a dynamic bid-price policy computed entirely offline from the relaxation (Torrico et al., 2017).

These two strands do not define oblivious bipartite matching in the query-commit sense. A plausible implication is that they provide a broader convex-analytic language for constrained-information matching: non-anticipativity is encoded either as roundability constraints on fractional trajectories or as explicit time-indexed inequalities on achievable probabilities.

5. Average-case analysis, metric variants, and the role of the adversary

In random bipartite graphs $W^*$6, the word oblivious is attached to an especially simple online rule. When a ball $W^*$7 arrives, the oblivious algorithm chooses a uniformly random bin from $W^*$8, without conditioning on whether that bin is already matched. If the selected bin is unmatched, the ball is matched; otherwise the attempt fails. For $W^*$9, the matching size satisfies

$w_{uv}$00

asymptotically almost surely. More generally, for every valid monotone $w_{uv}$01, the performance ratio of oblivious is at least $w_{uv}$02. The paper also proves that, under the $w_{uv}$03 model, greedy and Ranking have equivalent performance and that greedy has performance ratio at least $w_{uv}$04 for all valid $w_{uv}$05 (Mastin et al., 2013).

Here the terminology is algorithmic rather than adversarial: the oblivious algorithm is non-adaptive with respect to the current occupancy state. In the metric online-matching literature, by contrast, the central distinction is often the adversary model. The randomized RWGM algorithm for online minimum weighted bipartite matching in arbitrary metric spaces achieves

$w_{uv}$06

expected competitive ratio against an oblivious adversary, and the same bound applies to the fire station problem on the real line. The adversary fixes the full input before seeing the algorithm’s random choices; the analysis relies on probabilistic embeddings into $w_{uv}$07-HSTs and on the Randomized Weighted Greedy Matching procedure (0705.4673).

The line metric illustrates the difference sharply. On the one hand, Gupta and Lewi had obtained an $w_{uv}$08-competitive randomized algorithm only under an oblivious adversary. On the other hand, the RM-Algorithm was shown to be $w_{uv}$09-competitive on the line against an adaptive adversary. The deterministic RM result therefore matches the best known asymptotic ratio previously obtained only in the weaker oblivious-adversary model (Raghvendra, 2018).

The resulting terminology is easy to conflate but should be separated carefully. Oblivious algorithm means that the algorithm ignores part of the state when choosing actions. Oblivious adversary means that the input sequence is fixed before the algorithm’s random bits are realized. Query-commit oblivious matching, in contrast, is a hidden-edge model in which the uncertainty is in the graph itself rather than in an adversarial arrival order.

6. Deterministic and algebraic notions of obliviousness

A different but technically adjacent meaning of obliviousness arises in deterministic algebraic algorithms for bipartite matching. “Bipartite Exact Matching in P” studies the problem of deciding whether a colored bipartite graph has a perfect matching with exactly $w_{uv}$10 red edges. The paper proves the Affine-Slice Nonvanishing Conjecture for all bipartite braces and obtains a deterministic algorithm running in

$w_{uv}$11

The core algebraic encoding is the fixed Vandermonde-weighted matrix

$w_{uv}$12

with generating determinant $w_{uv}$13 and exact-$w_{uv}$14 coefficient polynomial $w_{uv}$15 (Du, 2 Apr 2026).

The paper explicitly notes that its evaluation schedule is entirely input-independent. For each brace block and target $w_{uv}$16, the algorithm evaluates $w_{uv}$17 at $w_{uv}$18 $w_{uv}$19-values and $w_{uv}$20 $w_{uv}$21-values, all fixed in advance, interpolates $w_{uv}$22, and checks whether the result is identically zero. The evaluation points are described as entirely input-independent and fixed in advance; correctness comes from structural nonvanishing rather than from Schwartz–Zippel randomness. The authors state that, in this algebraic sense, the method is “oblivious,” even though the tight-cut decomposition and brace analysis remain graph-dependent (Du, 2 Apr 2026).

This is not oblivious bipartite matching in the query-commit sense. It nevertheless provides a useful contrast. In the query-commit literature, obliviousness concerns hidden edges and irrevocable probes; in the exact-matching derandomization literature, obliviousness concerns fixed algebraic substitution points and non-adaptive evaluation patterns. A plausible implication is that the term has expanded from hidden-information models to broader forms of input-independent algorithm design.

Across these literatures, oblivious bipartite matching has evolved from a simple Ranking-style baseline with a $w_{uv}$23 guarantee into a technically richer subject involving quadratic primal–dual perturbations, online lossless rounding, dynamic relaxations of achievable matching probabilities, and multiple adversarial or probabilistic interpretations of what it means for a matching algorithm to act “without knowing.” The current edge-weighted distribution-free frontier is a $w_{uv}$24-competitive non-adaptive algorithm together with a $w_{uv}$25 upper bound in the bipartite case, leaving a substantial but now much narrower gap than the one that surrounded the original $w_{uv}$26 barrier (Huang et al., 25 Jul 2025).