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...

Full description

Saved in:
Bibliographic Details
Published inAutomata, Languages and Programming pp. 379 - 390
Main Author Badanidiyuru Varadaraja, Ashwinkumar
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2011
SeriesLecture Notes in Computer Science
Subjects
Bipartite Graph
Competitive Ratio
Free Disposal
Graph Construction
Online Algorithm
Online AccessGet full text
ISBN3642220053
9783642220050
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-22006-7_32

Cover

More Information
Summary: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.
ISBN:3642220053
9783642220050
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-22006-7_32