Lossless Online Rounding in Bipartite Matching

• The paper shows that by enforcing soundness in two-choice fractional algorithms, one can achieve lossless online rounding that preserves exact edge marginals despite inherent online integrality gaps.
• Lossless online rounding is a randomized procedure that converts online fractional matching decisions into integral solutions, ensuring each edge is selected with probability equal to its fractional value.
• Carefully maintained negative dependence and maximality conditions underpin competitive algorithms for both unweighted and vertex-weighted matching, surpassing traditional deterministic limits.

Searching arXiv for the cited paper and closely related work on online rounding and online bipartite matching. Lossless online rounding is an online randomized procedure that converts the decisions of a fractional online algorithm into an actual online integral solution while preserving the prescribed marginals exactly. In the online bipartite matching setting studied by Pollner, Saberi, and Wajc, this means that if a fractional algorithm assigns values $x_{i,t}$ to edges $(i,t)$ as online vertices arrive, then the rounded online matching $\mathcal M$ must satisfy $\Pr[(i,t)\in \mathcal M]=x_{i,t}$ for every edge, not merely match the same total expected value (Buchbinder et al., 2021). The subject is technically subtle because offline integrality of the bipartite matching polytope does not imply that such rounding can be performed online under irrevocability and partial information. The 2021 paper “Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)” reframed the area by showing that exact marginal preservation is impossible for arbitrary online fractional matchings, yet achievable for an important structured subclass via additional non-convex constraints and carefully maintained negative dependence (Buchbinder et al., 2021).

1. Definition and conceptual distinction

In the online bipartite matching model, a bipartite graph $G=(L,R,E)$ has offline vertices $L=[n]$ known in advance and online vertices $t\in R$ arriving one by one. Upon arrival of $t$, all incident edges $(i,t)$ are revealed and the algorithm must decide immediately and irrevocably whether and how to match $t$ (Buchbinder et al., 2021). In the vertex-weighted version, each offline vertex $(i,t)$0 has weight $(i,t)$1, and the objective is to maximize the total weight of matched offline vertices; in the unweighted case, all $(i,t)$2 (Buchbinder et al., 2021).

A fractional online algorithm maintains values $(i,t)$3, chosen online and irrevocably, subject to the online matching LP constraints

$(i,t)$4

Writing

$(i,t)$5

this quantity is the fractional degree of offline node $(i,t)$6 before time $(i,t)$7, and the fractional objective is $(i,t)$8 (Buchbinder et al., 2021).

An integral or randomized online algorithm instead outputs an actual matching $(i,t)$9, possibly using randomness, where each online vertex is either unmatched or matched to at most one currently free offline neighbor (Buchbinder et al., 2021). The strongest possible relation between the two notions is lossless online rounding: an online randomized procedure that, given the fractional decisions as they are produced, outputs a random matching $\mathcal M$0 such that

$\mathcal M$1

This preserves the fractional solution edge-by-edge in expectation and is therefore strictly stronger than preserving only the total expected objective (Buchbinder et al., 2021).

The central conceptual distinction is between offline and online integrality. Offline, the bipartite matching polytope is integral, so every feasible fractional matching can be rounded without loss. But that offline fact says nothing about whether the rounding can be done online, preserving every marginal irrevocably as vertices arrive (Buchbinder et al., 2021). This distinction is one of the defining ideas of the subject.

2. Impossibility and the meaning of “despite its impossibility”

The point of departure is the observation, attributed in the paper to Devanur, Jain, and Kleinberg (SODA’13), that lossless online rounding is impossible in general (Buchbinder et al., 2021). The representative counterexample in the paper uses a two-choice fractional algorithm that assigns $\mathcal M$2 to every revealed edge. If the first two online vertices have neighborhoods $\mathcal M$3 and $\mathcal M$4, then preserving marginals forces each of those arrivals to be matched with probability $\mathcal M$5. After those two steps, some cross-pair $\mathcal M$6 is simultaneously matched with probability at least $\mathcal M$7. If a third online vertex arrives adjacent exactly to that pair $\mathcal M$8, then it can be matched with probability at most $\mathcal M$9, while the fractional solution gives it value $\Pr[(i,t)\in \mathcal M]=x_{i,t}$0 (Buchbinder et al., 2021). Thus even a feasible two-choice fractional process need not be losslessly roundable online.

This impossibility already applies to natural strong fractional algorithms such as Balance (Buchbinder et al., 2021). The negative result therefore concerns unrestricted feasible online fractional matchings, not only artificial constructions.

The 2021 paper’s main conceptual refinement is that impossibility does not mean lossless online rounding is conceptually hopeless. Any randomized online algorithm trivially induces a fractional online algorithm with the same competitive ratio by setting $\Pr[(i,t)\in \mathcal M]=x_{i,t}$1, and such an induced fractional algorithm is, by definition, losslessly roundable online—namely by running the original randomized algorithm (Buchbinder et al., 2021). This suggests that the obstacle is not the idea of exact marginal preservation itself, but the insufficiency of the basic offline LP constraints in the online setting.

The paper therefore uses the phrase “online integrality gap” informally to denote the gap between what can be achieved by online fractional algorithms and what can be achieved by online integral or randomized algorithms under online information and irrevocability constraints (Buchbinder et al., 2021). A plausible implication is that “despite its impossibility” refers to a shift from trying to round arbitrary feasible fractional solutions to identifying subclasses of fractional processes whose marginals are compatible with an online randomized matching.

3. Sound two-choice algorithms and the lossless rounding theorem

The main positive theory is developed for two-choice algorithms, meaning that at each time $\Pr[(i,t)\in \mathcal M]=x_{i,t}$2, the fractional algorithm assigns positive mass to at most two neighbors. If

$\Pr[(i,t)\in \mathcal M]=x_{i,t}$3

then $\Pr[(i,t)\in \mathcal M]=x_{i,t}$4 (Buchbinder et al., 2021).

The key definition is soundness. A two-choice fractional online algorithm is sound if for every arrival $\Pr[(i,t)\in \mathcal M]=x_{i,t}$5,

$\Pr[(i,t)\in \mathcal M]=x_{i,t}$6

If equality holds for every $\Pr[(i,t)\in \mathcal M]=x_{i,t}$7, the algorithm is maximal (Buchbinder et al., 2021). When $\Pr[(i,t)\in \mathcal M]=x_{i,t}$8, say $\Pr[(i,t)\in \mathcal M]=x_{i,t}$9, this becomes

$G=(L,R,E)$0

The paper motivates this inequality by imagining that the matched statuses of offline vertices behave independently up to time $G=(L,R,E)$1. Then $G=(L,R,E)$2 is the probability that $G=(L,R,E)$3 is already matched, so the probability that both neighbors are unavailable would be $G=(L,R,E)$4, and hence the probability that the new online vertex can be matched at all is at most $G=(L,R,E)$5 (Buchbinder et al., 2021). What the paper proves is that for two-choice algorithms, this condition is not merely necessary-looking but sufficient when combined with a rounding scheme that maintains strong negative dependence.

The central theorem states that if $G=(L,R,E)$6 is a sound two-choice online fractional algorithm with output $G=(L,R,E)$7, then there exists a randomized online algorithm whose output matching $G=(L,R,E)$8 satisfies

$G=(L,R,E)$9

If $L=[n]$0 is maximal, this randomized algorithm can be implemented in polynomial time (Buchbinder et al., 2021).

This result gives an exact characterization only for the two-choice sound subclass, not for all online fractional matchings. That restriction is substantive rather than cosmetic. Later work on online dependent rounding schemes for arbitrary fractional bipartite matchings studies a different objective—approximate preservation via a rounding ratio—and explicitly notes that exact ratio $L=[n]$1 is impossible in general (Joseph et al., 2023). The 2021 theorem is therefore best understood as a precise positive island inside a broader impossibility landscape (Buchbinder et al., 2021).

4. Negative dependence, maximality, and rounding mechanics

The proof is organized around events $L=[n]$2, where $L=[n]$3 denotes that offline vertex $L=[n]$4 is free by time $L=[n]$5, and for $L=[n]$6,

$L=[n]$7

The rounding maintains the exact edge marginals together with the monotonicity condition

$L=[n]$8

whenever $L=[n]$9 (Buchbinder et al., 2021). Equivalently, $t\in R$0 is log-submodular, yielding the reverse-FKG type inequality

$t\in R$1

This implies pairwise negative correlation among free-status indicators, hence also among matched-status indicators (Buchbinder et al., 2021).

These correlations are not incidental. Soundness compares $t\in R$2 to a product of marginals, and negative correlation ensures that the true probability that all candidates are unavailable is at most that product (Buchbinder et al., 2021). This is the probabilistic mechanism that makes exact online marginal preservation feasible.

For maximal inputs, the maintained structure is stronger: $t\in R$3 and for every $t\in R$4,

$t\in R$5

Thus each set is either “negative” or fully independent (Buchbinder et al., 2021). This dichotomy is a key reason the maximal-case algorithm admits a polynomial-time implementation.

In the maximal case, if arrival $t\in R$6 has two relevant neighbors $t\in R$7, with current loads $t\in R$8, $t\in R$9, and increments $t$0, then if $t$1 is negative, the algorithm matches to the sole free one $t$2 with probability

$t$3

If $t$4 is independent and both are free, it matches to $t$5 with probability

$t$6

and to $t$7 with probability

$t$8

Under maximal soundness,

$t$9

so these probabilities sum to $(i,t)$0 (Buchbinder et al., 2021).

For non-maximal inputs, the paper gives a more general probability-setting program using $(i,t)$1 for the both-free case and $(i,t)$2 for the single-free case, constrained by

$(i,t)$3

$(i,t)$4

and the marginal equations

$(i,t)$5

where $(i,t)$6 (Buchbinder et al., 2021). The inductive proof uses these constraints to preserve both exact marginals and the reverse-FKG style dependence structure.

5. Competitive algorithms and main applications

The lossless-rounding theorem matters algorithmically because the paper also designs competitive sound fractional algorithms. For unweighted online matching it gives a maximal sound two-choice “restricted water level” algorithm: on each arrival, pick the two neighbors of minimum current load $(i,t)$7, and raise them to the common level

$(i,t)$8

so

$(i,t)$9

This satisfies

$t$0

hence is maximal sound (Buchbinder et al., 2021).

A primal-dual analysis yields competitiveness

$t$1

for any increasing convex bijection $t$2. Choosing $t$3 with $t$4 gives a lower bound of about $t$5, and the paper gives an adversarial instance showing the ratio is at most about $t$6. After lossless rounding, the resulting randomized online algorithm is $t$7-competitive (Buchbinder et al., 2021).

For vertex-weighted bipartite matching, the paper gives a $t$8-level maximal sound two-choice fractional algorithm with competitive ratio

$t$9

After rounding, this yields a $(i,t)$00-competitive randomized online algorithm, beating the deterministic $(i,t)$01 barrier (Buchbinder et al., 2021).

These guarantees support one of the paper’s principal applications: the amount of randomness or advice needed to beat deterministic online matching. Previous upper bounds were $(i,t)$02 or $(i,t)$03, while Peña and Borodin proved a lower bound of $(i,t)$04 bits for obtaining $(i,t)$05-competitiveness. The paper closes this gap by showing that

$(i,t)$06

random bits, or advice bits, are both necessary and sufficient to achieve competitive ratio

$(i,t)$07

for online vertex-weighted bipartite matching (Buchbinder et al., 2021). The “doubly-exponential improvement” refers to lowering sufficiency from polynomial or linear in $(i,t)$08 to doubly logarithmic in $(i,t)$09.

The second major application is online correlated selection. Fahrbach et al. introduced $(i,t)$10-semi-OCS, where an element appearing in $(i,t)$11 pairs remains unchosen with probability at most

$(i,t)$12

Gao et al. later showed the optimum is $(i,t)$13. The paper derives this optimum through lossless online rounding by defining a sound fractional process with cumulative load

$(i,t)$14

for an item that has appeared in $(i,t)$15 pairs so far, and increment

$(i,t)$16

The resulting selector satisfies

$(i,t)$17

and since

$(i,t)$18

this gives a $(i,t)$19-semi-OCS, matching the optimum from a different derivational route (Buchbinder et al., 2021).

6. Scope, limitations, and relation to broader online rounding research

The positive characterization is explicitly limited to two-choice fractional algorithms. A natural extension to multiple-choice algorithms would require

$(i,t)$20

but the paper proves that these stronger constraints are still not sufficient for lossless online rounding: there exists a three-choice fractional algorithm satisfying them that cannot be losslessly rounded online (Buchbinder et al., 2021). The theory is therefore not a full characterization of online roundability.

This limitation sharply distinguishes exact lossless online rounding from later approximate frameworks. “Online Dependent Rounding Schemes for Bipartite Matchings, with Applications” formalizes a rounding ratio $(i,t)$21 for arbitrary online-revealed fractional bipartite $(i,t)$22-matchings, proving ratios $(i,t)$23 for simple matchings and $(i,t)$24 for $(i,t)$25-matchings, while also emphasizing that exact ratio $(i,t)$26 is impossible in general (Joseph et al., 2023). That line of work studies unrestricted inputs but settles for approximate marginal preservation. By contrast, the 2021 lossless theory attains exact preservation but only under structural constraints (Buchbinder et al., 2021).

A different but related perspective appears in the tutorial “Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching,” which surveys sequential randomized rounding methods that often preserve marginals only after a multiplicative scaling, such as $(i,t)$27 in stochastic knapsack or $(i,t)$28 in simple online stochastic matching (Ma, 2024). This suggests a broader taxonomy: exact lossless online rounding is rare, scaled exactness is more common, and both depend heavily on the structure of the underlying feasibility system.

Other works use the phrase “lossless online rounding” in different models. In online stochastic matching with correlated arrivals, a new rounding scheme in the $(i,t)$29 model preserves per-type routing marginals exactly,

$(i,t)$30

but this is a demand-aware single-type construction rather than an unrestricted online bipartite matching theorem (Aouad et al., 2022). In online multi-class selection with overlapping classes, “lossless” means preservation of expected total utility and, for proportional fairness, of each class’s expected utility, not edge-by-edge matching marginals (Zargari et al., 23 Oct 2025). These differences indicate that the term is model-sensitive.

The 2021 paper’s enduring contribution is therefore methodological as much as algorithmic. It replaces the coarse statement “lossless online rounding is impossible” with a finer one: arbitrary feasible online fractional matchings cannot be losslessly rounded online, but by adding the right non-convex online constraints—soundness for two-choice algorithms—and maintaining carefully designed negative dependence invariants, one obtains a constructive family that is losslessly roundable online and already strong enough to beat deterministic bounds (Buchbinder et al., 2021). A plausible implication is that the main open direction is not whether online lossless rounding exists at all, but how far the class of exactly roundable online fractional processes can be extended beyond two choices.