Buyback problem: approximate matroid intersection with cancellation costs

In the buyback problem, an algorithm observes a sequence of bids and must decide whether to accept each bid at the moment it arrives, subject to some constraints on the set of accepted bids. Decisions to reject bids are irrevocable, whereas decisions to accept bids may be canceled at a cost that is a fixed fraction of the bid value. Previous to our work, deterministic and randomized algorithms were known when the constraint is a matroid constraint. We extend this and give a deterministic algorithm for the case when the constraint is an intersection of k matroid constraints. We further prove a matching lower bound on the competitive ratio for this problem. This problem has applications to banner advertisement, semi-streaming, routing, load balancing and other problems where preemption or cancellation of previous allocations is allowed.

[1]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[2]  B. Korte,et al.  An Analysis of the Greedy Heuristic for Independence Systems , 1978 .

[3]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[4]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[5]  Sandy Irani,et al.  Bounding the power of preemption in randomized scheduling , 1995, STOC '95.

[6]  Moti Yung,et al.  Efficient On-Line Call Control Algorithms , 1997, J. Algorithms.

[7]  Yossi Azar,et al.  Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms , 1999, SODA '99.

[8]  Yossi Azar,et al.  Combining online algorithms for rejection and acceptance , 2003, SPAA '03.

[9]  Graham Cormode,et al.  Space efficient mining of multigraph streams , 2005, PODS.

[10]  Andrew McGregor,et al.  Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.

[11]  Joan Feigenbaum,et al.  Graph distances in the streaming model: the value of space , 2005, SODA '05.

[12]  Robert D. Kleinberg.  A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.

[13]  Joan Feigenbaum,et al.  On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..

[14]  Tero Harju,et al.  Positivity of second order linear recurrent sequences , 2006, Discret. Appl. Math..

[15]  Camil Demetrescu,et al.  Trading off space for passes in graph streaming problems , 2006, SODA 2006.

[16]  Martin Skutella,et al.  Evolutionary algorithms and matroid optimization problems , 2007, GECCO.

[17]  Vahab Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.

[18]  Mohammad Taghi Hajiaghayi,et al.  Automated Online Mechanism Design and Prophet Inequalities , 2007, AAAI.

[19]  Fan Chung Graham,et al.  Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.

[20]  Nicole Immorlica,et al.  Matroids, secretary problems, and online mechanisms , 2007, SODA '07.

[21]  Nicole Immorlica,et al.  A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.

[22]  Raffaele Giancarlo,et al.  New results for finding common neighborhoods in massive graphs in the data stream model , 2008, Theor. Comput. Sci..

[23]  Robert D. Kleinberg,et al.  Selling Banner Ads: Online Algorithms with Buyback , 2008 .

[24]  Sreenivas Gollapudi,et al.  Estimating PageRank on graph streams , 2008, PODS.

[25]  Vahab S. Mirrokni,et al.  Non-monotone submodular maximization under matroid and knapsack constraints , 2009, STOC '09.

[26]  Martin Pál,et al.  Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.

[27]  Robert D. Kleinberg,et al.  Randomized Online Algorithms for the Buyback Problem , 2009, WINE.

[28]  Moshe Babaioff,et al.  Selling ad campaigns: online algorithms with cancellations , 2009, EC '09.

[29]  Jon Feldman,et al.  An online mechanism for ad slot reservations with cancellations , 2009, SODA.

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

[31]  Shuchi Chawla,et al.  Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.

[32]  Leah Epstein,et al.  Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model , 2009, SIAM J. Discret. Math..

[33]  Sorin C. Popescu,et al.  Lidar Remote Sensing , 2011 .