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

Abstract 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.
AbstractList 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.
Author Badanidiyuru Varadaraja, Ashwinkumar
Author_xml – sequence: 1
  givenname: Ashwinkumar
  surname: Badanidiyuru Varadaraja
  fullname: Badanidiyuru Varadaraja, Ashwinkumar
  email: ashwin85@cs.cornell.edu
  organization: Cornell University, Ithaca, USA
BookMark eNo1kMtOwzAQRQ0Uibb0D1j4BwxjT2LXS4h4FBXBAtaWX4XQNK7iIODvSQusRjojXd17JmTUpjYScsbhnAOoC63mDJksBBMCQDJlUByQ2YBxgHumDsmYS84ZYqGPyOT_UeKIjAFBMK0KPCGTnN8BQCgtxuT-6uPbWb-mT11yTdxQRi-32y591RvbR_pg-y7VgS7aPnY5-r5OLf2s-zda2dbHprF7UqXc51NyvLJNjrO_OyUvN9fP1R1bPt4uqssly5zj0B8iurASQSlVgJBSax7m0q28RGGLoLyWoFxZBI9l1N45bwsR57YMDp3yOCXiNzdvu7p9jZ1xKa2z4WB2qszgxKAZxpu9FrNThT8lAFnN
ContentType Book Chapter
Copyright Springer-Verlag Berlin Heidelberg 2011
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2011
DOI 10.1007/978-3-642-22006-7_32
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISBN 9783642220067
3642220061
EISSN 1611-3349
Editor Aceto, Luca
Henzinger, Monika
Sgall, Jiří
Editor_xml – sequence: 1
  givenname: Luca
  surname: Aceto
  fullname: Aceto, Luca
  email: luca@ru.is
– sequence: 2
  givenname: Monika
  surname: Henzinger
  fullname: Henzinger, Monika
  email: mhenzinger@gmail.com
– sequence: 3
  givenname: Jiří
  surname: Sgall
  fullname: Sgall, Jiří
  email: sgall@kam.mff.cuni.cz
EndPage 390
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-s1132-20e3bdf2d77740266991d86bfc632a4d7c9607b54dc35e9cbbca42e8a5db3b7c3
ISBN 3642220053
9783642220050
ISSN 0302-9743
IngestDate Wed Sep 17 03:57:42 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s1132-20e3bdf2d77740266991d86bfc632a4d7c9607b54dc35e9cbbca42e8a5db3b7c3
PageCount 12
ParticipantIDs springer_books_10_1007_978_3_642_22006_7_32
PublicationCentury 2000
PublicationDate 2011
PublicationDateYYYYMMDD 2011-01-01
PublicationDate_xml – year: 2011
  text: 2011
PublicationDecade 2010
PublicationPlace Berlin, Heidelberg
PublicationPlace_xml – name: Berlin, Heidelberg
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSubtitle 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I
PublicationTitle Automata, Languages and Programming
PublicationYear 2011
Publisher Springer Berlin Heidelberg
Publisher_xml – name: Springer Berlin Heidelberg
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Steffen, Bernhard
Kittler, Josef
Vardi, Moshe Y.
Weikum, Gerhard
Sudan, Madhu
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, Lancaster, UK
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, UK
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, Stanford, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
  organization: University of Bern, Bern, Switzerland
– sequence: 9
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology, Madras, India
– sequence: 10
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: University of Dortmund, Dortmund, Germany
– sequence: 11
  givenname: Madhu
  surname: Sudan
  fullname: Sudan, Madhu
  organization: Massachusetts Institute of Technology, USA
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: University of California, Los Angeles, USA
– sequence: 13
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
  organization: University of California, Berkeley, USA
– sequence: 14
  givenname: Moshe Y.
  surname: Vardi
  fullname: Vardi, Moshe Y.
  organization: Rice University, Houston, USA
– sequence: 15
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max-Planck Institute of Computer Science, Saarbrücken, Germany
SSID ssj0002792
ssj0000530724
Score 1.5572641
Snippet 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...
SourceID springer
SourceType Publisher
StartPage 379
SubjectTerms Bipartite Graph
Competitive Ratio
Free Disposal
Graph Construction
Online Algorithm
Title Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
URI http://link.springer.com/10.1007/978-3-642-22006-7_32
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELZguQAHoIB4ywduUdAmTpz0wAGqomrV9tRWvUUZ2xHLYyMlWdH21zPjx66hFVK5RLvRKvHOl4zHn-ebYey91CYDkHUq665LccYv0lrWkMK8LgoqBqJsS5ajY3lwWizOy_NtQqZVl0zwQV3dqCv5H1TxHOJKKtlbILu5KJ7Az4gvHhFhPP4V_P5Js3oV5NRjuNk6dbNjHceQ_E85Vz_DrGSJSt2ulnp5uR7WyVk74Neh_eY41fHrL1yQUqp1_Px8Xl9Cq77TxajjTJJSwDr0F0u8J_UrmoZ-qR2hOBrXb9xyunv0GP1wGXbobUZXKcraw4wfD_2WxXE_2UywJHSVCE4mZiGsFi9mIQILmfyjSJcVjBDjRDVnIjcn0Cfjqsa5OePcsKTiisIVM_WuVbimM36WFq7J6LUJIM75kKQ8spRJ1Qicpu_iAGbs3qf9xeHZhodDJzSvSCHjZ28qqOh2ntyoSA8URi1cxabtv4i0mDfd8truug1aTh6zhyRk4aQwQQM_YXfMaoc9Cgbn3uA77MHRpnTv-JQtPPDcA89THgHPPfA8Bp4T8DwGnlvgn7HTL_snewepb7iRjlkmcORzI0B3ua5wUYCLc4mLB11L6JQUeVvoSuHbW0FZaCVKs6sAVFvkpm5LDQIqJZ6z2apfmReMdzDXRuSgMhCF0XpXaQy2hTRV2UKWdy9ZEkzT0Cs0NqF-NhqyEQ0asrGGbMiQr27169fs_vYRfcNm07A2bzF0nOCdR_83ZAtmvA
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Automata%2C+Languages+and+Programming&rft.au=Badanidiyuru+Varadaraja%2C+Ashwinkumar&rft.atitle=Buyback+Problem+-+Approximate+Matroid+Intersection+with+Cancellation+Costs&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2011-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.isbn=9783642220050&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=379&rft.epage=390&rft_id=info:doi/10.1007%2F978-3-642-22006-7_32
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon