Advertisement

Leasing with Uncertainty

  • Christine MarkarianEmail author
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

Theoretical study of real-life leasing scenarios was initiated in 2005 with a simple leasing model defined as follows. Demands arrive with time and need to be served by leased resources. Different types of leases are available, each with a fixed duration and price, respecting economy of scale (longer leases cost less per unit time). An algorithm is to lease resources at minimum possible costs in order to serve each arriving demand, without knowing future demands. In this paper, we generalize this model and introduce the Lease-or-Decline and Lease-or-Delay leasing models. In the Lease-or-Decline model, not all demands need to be served, i.e., the algorithm may decline a demand as long as a penalty associated with it is paid. In the Lease-or-Delay model, each demand has a deadline and can be served any day before its deadline as long as a penalty is paid for each delayed day. The goal is to minimize the total cost of purchased leases and penalties paid. For each of these models we give a deterministic online primal-dual algorithm, evaluated using the standard competitive analysis in which an online algorithm is compared to the optimal offline algorithm which knows the entire sequence of demands in advance and is optimal.

References

  1. 1.
    Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk, P. (2015). Towards the price of leasing online. Journal of Combinatorial Optimization, 1–20.Google Scholar
  2. 2.
    Bienkowski, M., Kraska, A., & Schmidt, P. (2017). A deterministic algorithm for online steiner tree leasing. In Algorithms and Data Structures Symposium (WADS 2017), August 2017, Proceedings.Google Scholar
  3. 3.
    Epstein, L., & Zebedat-Haider, H. (2011). Online scheduling with rejection and withdrawal. Theoretical Computer Science, 412(48), 6666–6674.CrossRefGoogle Scholar
  4. 4.
    Hajiaghayi, M. T., Liaghat, V., & Panigrahi, D. (2014). Near-optimal online algorithms for prize-collecting steiner problems. In ICALP.Google Scholar
  5. 5.
    Shouwei, L., Mäcker, A., Markarian, C., auf der Heide, F. M., & Riechers, S. (2015). Towards flexible demands in online leasing problems. In Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings, 277–288.Google Scholar
  6. 6.
    Meyerson, A. (2005). The parking permit problem. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, 274–284.Google Scholar
  7. 7.
    Nagarajan, C., & Williamson, D. P. (2013). Offline and online facility leasing. Discrete Optimization, 10(4), 361–370.CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Heinz Nixdorf Institute and Computer Science DepartmentPaderborn UniversityPaderbornGermany

Personalised recommendations