<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T23:35:08Z</responseDate>
  <request identifier="1331" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1331</identifier>
        <datestamp>2024-03-06T10:33:01Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental</dc:title>
          <dc:creator>Lotker, Zvi</dc:creator>
          <dc:creator>Patt-Shamir, Boaz</dc:creator>
          <dc:creator>Rawitz, Dror</dc:creator>
          <dc:subject>Competitive analysis</dc:subject>
          <dc:subject>ski rental</dc:subject>
          <dc:subject>randomized algorithms</dc:subject>
          <dc:description>In the Multislope Ski Rental problem, the user needs a certain&#13;
   resource for some unknown period of time.  To use the resource, the&#13;
   user must subscribe to one of several options, each of which&#13;
   consists of a one-time setup cost (``buying price''), and cost&#13;
   proportional to the duration of the usage (``rental rate'').  The&#13;
   larger the price, the smaller the rent.  The actual usage time is&#13;
   determined by an adversary, and the goal of an algorithm is to&#13;
   minimize the cost by choosing the best option at any point in time.&#13;
   Multislope Ski Rental is a natural generalization of the classical&#13;
   Ski Rental problem (where the only options are pure rent and pure&#13;
   buy), which is one of the fundamental problems of online&#13;
   computation.  The Multislope Ski Rental problem is an abstraction&#13;
   of many problems where online decisions cannot be modeled by just&#13;
   two options, e.g., power management in systems which can be shut&#13;
   down in parts.  In this paper we study randomized algorithms for&#13;
   Multislope Ski Rental.  Our results include the best possible&#13;
   online randomized strategy for any additive instance, where the&#13;
   cost of switching from one option to another is the difference in&#13;
   their buying prices; and an algorithm that produces an&#13;
   $e$-competitive randomized strategy for any (non-additive)&#13;
   instance.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Zvi Lotker and Boaz Patt-Shamir and Dror Rawitz</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.STACS.2008.1331</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-13313</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1331</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
