Online Matching in Regular Bipartite Graphs
Abstract
In an online problem, the input is revealed one piece at a time. In every time step, the online algorithm has to produce a part of the output, based on the partial knowledge of the input. Such decisions are irrevocable, and thus online algorithms usually lead to nonoptimal solutions. The impact of the partial knowledge depends strongly on the problem. If the algorithm is allowed to read binary information about the future, the amount of bits read that allow the algorithm to solve the problem optimally is the so-called advice complexity. The quality of an online algorithm is measured by its competitive ratio, which compares its performance to that of an optimal offline algorithm.
In this paper we study online bipartite matchings focusing on the particular case of bipartite matchings in regular graphs. We give tight upper and lower bounds on the competitive ratio of the online deterministic bipartite matching problem. The competitive ratio turns out to be asymptotically equal to the known randomized competitive ratio. Afterwards, we present an upper and lower bound for the advice complexity of the online deterministic bipartite matching problem.
References
- 1. , Online Computation and Competitive Analysis (Cambridge University Press, 1998). Google Scholar
- 2. , An Introduction to Online Computation (Springer, 2016). Crossref, Google Scholar
- 3. , An optimal algorithm for on-line bipartite matching, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC) (
1990 ), pp. 352–358. Google Scholar - 4. , AdWords and generalized online matching, Journal of the ACM 54(5) :1–19 (2007). Crossref, ISI, Google Scholar
- 5. , Randomized online algorithms for minimum metric bipartite matching, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (
2006 ), pp. 954–959. Google Scholar - 6. , Online weighted matching, Journal of Algorithms 14(3) :478–488 (1993). Crossref, ISI, Google Scholar
- 7. , Online matching on a line, Electronic Notes in Discrete Mathematics 13 :49–51 (2003). Crossref, Google Scholar
- 8. , Online bipartite perfect matching with augmentations, in Proceedings of IEEE INFOCOM (
2009 ), pp. 1044–1052. Google Scholar - 9. B. Birnbaum and C. Mathieu, On-line bipartite matching made simple, ACM SIGACT News 39(1):80 (2008). Google Scholar
- 10. , Online bipartite matching with random arrivals: An approach based on strongly factor-revealing LPs, in Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC) (
2011 ), pp. 597–605. Google Scholar - 11. , Online stochastic matching: Beating , in Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS) (
2009 ), pp. 117–126. Google Scholar - 12. , Near-optimum online Ad allocation for targeted advertising, in Proceedings of the Sixteenth ACM Conference on Economics and Computation (EC’15) (
2015 ), pp. 131–148. Google Scholar - 13. , Graph Theory, 3rd edn. (Springer, 2005). Google Scholar
- 14. ,
How much information about the future is needed? , SOFSEM 2008: Theory and Practice of Computer Science,Lecture Notes in Computer Science , Vol. 4910 (2008), pp. 247–258. Crossref, Google Scholar - 15. ,
Online computation with advice , Automata, Languages and Programming (ICALP 2009),Lecture Notes in Computer Science , Vol. 5555 (2009), pp. 427–438. Crossref, Google Scholar - 16. ,
On the advice complexity of online problems , Algorithms and Computation (ISAAC 2009),Lecture Notes in Computer Science , Vol. 5878 (2009), pp. 331–340. Crossref, Google Scholar - 17. , On the advice complexity of online bipartite matching and online stable marriage, Information Processing Letters 114(12) :714–717 (2014). Crossref, ISI, Google Scholar


