In their seminal paper, Karp, Vazirani and Vazirani (STOC'90) introduce the online bipartite matching problem, and the RANKING algorithm, which admits a tight $1-\frac{1}{e}$ competitive ratio. Since its publication, the problem has received considerable attention, including a sequence of simplified proofs. In this paper we present a new proof that gives an economic interpretation of the RANKING algorithm -- further simplifying the proof and avoiding arguments such as duality. The new proof gives a new perspective on previous proofs.
翻译：Karp、Vazirani和Vazirani(STOC'90)在他们的重要论文《Karp、Vazirani和Vazirani》(STOC'90)中提出了在线双方匹配问题和RANKING算法,后者承认了严格的1\frac{1 ⁇ {{{{{{{e}美元竞争比率,自其公布以来,这个问题得到了相当的重视,包括一系列简化的证明。在这份文件中,我们提出了一个新的证据,对RANKing算法作了经济解释,进一步简化了证据,避免了双重性等论点。新的证据为以前的证明提供了新的视角。
相关内容
微信扫码咨询专知VIP会员