IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2506.00909.html
   My bibliography  Save this paper

Constant-Factor Algorithms for Revenue Management with Consecutive Stays

Author

Listed:
  • Ming Hu
  • Tongwen Wu

Abstract

We study network revenue management problems motivated by applications such as railway ticket sales and hotel room bookings. Request types that require a resource for consecutive stays sequentially arrive with known arrival probabilities. We investigate two scenarios: the reject-or-accept scenario, where the request can be fulfilled by any available resource, and the choice-based scenario, which generalizes the former by incorporating customer preferences through basic attraction models. We develop constant-factor approximation algorithms: $1-1/e$ for the reject-or-accept scenario and $0.125$ for the choice-based scenario.

Suggested Citation

  • Ming Hu & Tongwen Wu, 2025. "Constant-Factor Algorithms for Revenue Management with Consecutive Stays," Papers 2506.00909, arXiv.org.
    • Handle: RePEc:arx:papers:2506.00909
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2506.00909
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2506.00909. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.