标题： 通过平滑性进行在线二分匹配 显示英文标题

标题： Online Bipartite Matching via Smoothness

摘要： 在线二部图匹配问题有离线买家希望与在线物品进行匹配。 Eden 等人（2021）对在线二部图匹配的分析是一种平滑性证明（Syrgkanis 和 Tardos，2013）。 此外，它可以被解释为结合了一个$\lambda = 1-1/e$值覆盖（适用于单维代理和随机拍卖）和$\mu = 1$收益覆盖（Hartline 等人，2014）。 请注意，值覆盖是关于单维代理的事实，与底层可行性设置无关。 因此，Eden 等人（2021）的主要新结果是在线二部图匹配是$\mu=1$收益覆盖的。 从这个观点出发，可以得出许多旧的和新的观察结果。 显示英文摘要

摘要： 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.