While randomized online algorithms have access to a sequence of uniform random bits, deterministic online algorithms with advice have access to a sequence of advice bits, i.e., bits that are set by an all-powerful oracle prior to the processing of the request sequence. Advice bits are at least as helpful as random bits, but how helpful are they? In this work, we investigate the power of advice bits and random bits for online maximum bipartite matching (MBM). The well-known Karp-Vazirani-Vazirani algorithm [24] is an optimal randomized (1− 1 e )-competitive algorithm for MBM that requires access to Θ(n log n) uniform random bits. We show that Ω(log( 1 )n) advice bits are necessary and O( 1 5 n) sufficient in order to obtain a (1 − )-competitive deterministic advice algorithm. Furthermore, for a large natural class of deterministic advice algorithms, we prove that Ω(log log log n) advice bits are required in order to improve on the 1 2 -competitiveness of the best deterministic online algorithm, while it is known that O(log n) bits are sufficient [9] . Last, we give a randomized online algorithm that uses cn random bits, for integers c ≥ 1, and a competitive ratio that approaches 1 − 1 e very quickly as c is increasing. For example if c = 10, then the difference between 1 − 1 e and the achieved competitive ratio is less than 0.0002.
In the online with advice model for bipartite matching, Dürr et al REF apply the Böckenhauer et al de-randomization idea to show that for every > 0, there is an (inefficient) O(log n) advice algorithm achieving ratio (1 − )(1 − 1 e ).
On the Power of Advice and Randomization for Online Bipartite Matching
ArXiv
ArXiv
Computer Science Mathematics