The online bipartite matching problem has offline buyers desiring to be matched to online items. The analysis of online bipartite matching of Eden et al. (2021) is a smoothness proof (Syrgkanis and Tardos, 2013). Moreover, it can be interpreted as combining a $\lambda = 1-1/e$ value covering (which holds for single-dimensional agents and randomized auctions) and $\mu = 1$ revenue covering (Hartline et al., 2014). Note that value covering is a fact about single-dimensional agents and has nothing to do with the underlying feasibility setting. Thus, the essential new result from Eden et al. (2021) is that online bipartite matching is $\mu=1$ revenue covered. A number of old and new observations follow from this perspective.

翻译：在线二分图匹配问题中，离线买家希望与在线物品进行匹配。Eden等人（2021）对在线二分图匹配的分析本质上是一种光滑性证明（Syrgkanis and Tardos, 2013）。此外，该分析可被解读为将$\lambda = 1-1/e$的价值覆盖（适用于单维代理与随机化拍卖）与$\mu = 1$的收益覆盖（Hartline et al., 2014）相结合。需要指出的是，价值覆盖是单维代理的固有性质，与底层可行性设定无关。因此，Eden等人（2021）的核心新发现在于：在线二分图匹配具有$\mu=1$的收益覆盖性质。基于这一视角，可推导出若干新旧结论。