Combinatorial Ski Rental and Online Bipartite Matching

We consider a combinatorial variant of the classical ski rental problem --- which we call combinatorial ski rental --- where multiple resources are available to purchase and to rent, and are demanded online. Moreover, the costs of purchasing and renting are potentially combinatorial. The dual problem of combinatorial ski rental, which we call combinatorial online bipartite matching, generalizes the classical online bipartite matching problem into a form where constraints, induced by both offline and online vertices, can be combinatorial. We give a 2-competitive (resp. e / (e - 1)-competitive) deterministic (resp. randomized) algorithm for combinatorial ski rental, and an e / (e - 1)-competitive algorithm for combinatorial online bipartite matching. All these ratios are optimal given simple lower bounds inherited from the respective well-studied special cases. We also prove information-theoretic impossibility of constant-factor algorithms when any part of our assumptions is considerably relaxed.

[1]  Jon Feldman,et al.  Online Ad Assignment with Free Disposal , 2009, WINE.

[2]  Thomas P. Hayes,et al.  The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.

[3]  Yossi Azar,et al.  Online Mixed Packing and Covering , 2012, SODA.

[4]  Jan Vondrák,et al.  Online Submodular Welfare Maximization: Greedy is Optimal , 2012, SODA.

[5]  T.-H. Hubert Chan,et al.  Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids , 2017, SODA.

[6]  Joseph Naor,et al.  Towards the randomized k-server conjecture: a primal-dual approach , 2010, SODA '10.

[7]  BansalNikhil,et al.  A Polylogarithmic-Competitive Algorithm for the k-Server Problem , 2015 .

[8]  Jon Feldman,et al.  Online Stochastic Packing Applied to Display Ad Allocation , 2010, ESA.

[9]  Uriel Feige,et al.  On maximizing welfare when utility functions are subadditive , 2006, STOC '06.

[10]  Nikhil R. Devanur,et al.  Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching , 2013, SODA.

[11]  Aranyak Mehta,et al.  Online Matching and Ad Allocation , 2013, Found. Trends Theor. Comput. Sci..

[12]  Joseph Naor,et al.  Improved bounds for online routing and packing via a primal-dual approach , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[13]  Gagan Goel,et al.  Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations , 2010, SODA.

[14]  Noga Alon,et al.  The online set cover problem , 2003, STOC '03.

[15]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[16]  Anna R. Karlin,et al.  Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

[17]  Noga Alon,et al.  A general approach to online network optimization problems , 2004, SODA '04.

[18]  Yajun Wang,et al.  Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm , 2015, ICALP.

[19]  Sreenivas Gollapudi,et al.  Online Algorithms for Rent-Or-Buy with Expert Advice , 2019, ICML.

[20]  Claire Mathieu,et al.  Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.

[21]  Joseph Naor,et al.  A Polylogarithmic-Competitive Algorithm for the k-Server Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[22]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[23]  Aranyak Mehta,et al.  Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.

[24]  Joseph Naor,et al.  A primal-dual randomized algorithm for weighted paging , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[25]  Yuhao Zhang,et al.  Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model , 2019, SODA.

[26]  Nikhil R. Devanur,et al.  Whole-page optimization and submodular welfare maximization with online bidders , 2013, EC '13.

[27]  Zhiyi Huang,et al.  Welfare maximization with production costs: A primal dual approach , 2019, Games Econ. Behav..

[28]  Yossi Azar,et al.  Online Algorithms for Covering and Packing Problems with Convex Objectives , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[29]  Yajun Wang,et al.  Matroid Online Bipartite Matching and Vertex Cover , 2016, EC.

[30]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[31]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[32]  Boaz Patt-Shamir,et al.  Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental , 2008, SIAM J. Discret. Math..

[33]  Yuhao Zhang,et al.  How to match when all vertices arrive online , 2018, STOC.

[34]  Joseph Naor,et al.  Randomized competitive algorithms for generalized caching , 2008, STOC.

[35]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.

[36]  Elad Hazan,et al.  Online submodular minimization , 2009, J. Mach. Learn. Res..

[37]  Sally A. Goldman,et al.  TCP Dynamic Acknowledgment Delay: Theory and Practice , 1998, STOC 1998.

[38]  Debmalya Panigrahi,et al.  The Semi-stochastic Ski-rental Problem , 2011, FSTTCS.