Buyback Problem - Approximate matroid intersection with cancellation costs

@inproceedings{Badanidiyuru2011BuybackP,
  title={Buyback Problem - Approximate matroid intersection with cancellation costs},
  author={Ashwinkumar Badanidiyuru},
  booktitle={ICALP},
  year={2011}
}
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… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

An analysis of the greedy heuristic for independence systems

  • B. Korte, D. Hausmann
  • Proc . of 7 th South Eastern Conference on…
  • 1976

Optimal choice of the stopping moment of a Markov process

  • E. B. Dynkin
  • Dokl . Akad . Nauk SSSR
  • 1963

Similar Papers

Loading similar papers…