Dynamic pricing for hotel rooms when customers request multiple-day stays

Prominent hotel chains quote a booking price for a particular type of rooms on each day and dynamically update these prices over time. We present a novel Markov decision process (MDP) formulation that determines the optimal booking price for a single type of rooms under this strategy, while consider...

Full description

Saved in:
Bibliographic Details
Main Authors: NADARAJAH, Selvaprabu, LIM, Yun Fong, DING, Qing
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2015
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/5147
https://ink.library.smu.edu.sg/context/lkcsb_research/article/6146/viewcontent/DynamicPricingHotelRooms_2015_wp.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.lkcsb_research-6146
record_format dspace
spelling sg-smu-ink.lkcsb_research-61462018-11-14T09:28:03Z Dynamic pricing for hotel rooms when customers request multiple-day stays NADARAJAH, Selvaprabu LIM, Yun Fong DING, Qing Prominent hotel chains quote a booking price for a particular type of rooms on each day and dynamically update these prices over time. We present a novel Markov decision process (MDP) formulation that determines the optimal booking price for a single type of rooms under this strategy, while considering the availability of rooms throughout the multiple-day stays requested by customers. We analyze special cases of our MDP to highlight the importance of modeling multiple-day stays and provide guidelines to potentially simplify the implementation of pricing policies around peak-demand events such as public holidays and conferences. Since computing an optimal policy to our MDP is intractable in general, we develop heuristics based on a fluid approximation and approximate linear programming (ALP). We numerically benchmark our heuristics against a single-day decomposition approach (SDD) and an adaptation of a fixed-price heuristic. The ALP-based heuristic (i) outperforms the other methods; (ii) generates up to 7% and 6% more revenue than the SDD and the fixed-price heuristic respectively; and (iii) incurs a revenue loss of only less than 1% when using our pricing structure around peak-demand events, which supports the use of this simple pricing profile. Our findings are potentially relevant beyond the hotel domain for applications involving the dynamic pricing of capacitated resources. 2015-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/lkcsb_research/5147 https://ink.library.smu.edu.sg/context/lkcsb_research/article/6146/viewcontent/DynamicPricingHotelRooms_2015_wp.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Hotel Revenue Management Resource Pricing Markov Decision Processes Approximate Linear Programming Hospitality Administration and Management Operations and Supply Chain Management
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Hotel Revenue Management
Resource Pricing
Markov Decision Processes
Approximate Linear Programming
Hospitality Administration and Management
Operations and Supply Chain Management
spellingShingle Hotel Revenue Management
Resource Pricing
Markov Decision Processes
Approximate Linear Programming
Hospitality Administration and Management
Operations and Supply Chain Management
NADARAJAH, Selvaprabu
LIM, Yun Fong
DING, Qing
Dynamic pricing for hotel rooms when customers request multiple-day stays
description Prominent hotel chains quote a booking price for a particular type of rooms on each day and dynamically update these prices over time. We present a novel Markov decision process (MDP) formulation that determines the optimal booking price for a single type of rooms under this strategy, while considering the availability of rooms throughout the multiple-day stays requested by customers. We analyze special cases of our MDP to highlight the importance of modeling multiple-day stays and provide guidelines to potentially simplify the implementation of pricing policies around peak-demand events such as public holidays and conferences. Since computing an optimal policy to our MDP is intractable in general, we develop heuristics based on a fluid approximation and approximate linear programming (ALP). We numerically benchmark our heuristics against a single-day decomposition approach (SDD) and an adaptation of a fixed-price heuristic. The ALP-based heuristic (i) outperforms the other methods; (ii) generates up to 7% and 6% more revenue than the SDD and the fixed-price heuristic respectively; and (iii) incurs a revenue loss of only less than 1% when using our pricing structure around peak-demand events, which supports the use of this simple pricing profile. Our findings are potentially relevant beyond the hotel domain for applications involving the dynamic pricing of capacitated resources.
format text
author NADARAJAH, Selvaprabu
LIM, Yun Fong
DING, Qing
author_facet NADARAJAH, Selvaprabu
LIM, Yun Fong
DING, Qing
author_sort NADARAJAH, Selvaprabu
title Dynamic pricing for hotel rooms when customers request multiple-day stays
title_short Dynamic pricing for hotel rooms when customers request multiple-day stays
title_full Dynamic pricing for hotel rooms when customers request multiple-day stays
title_fullStr Dynamic pricing for hotel rooms when customers request multiple-day stays
title_full_unstemmed Dynamic pricing for hotel rooms when customers request multiple-day stays
title_sort dynamic pricing for hotel rooms when customers request multiple-day stays
publisher Institutional Knowledge at Singapore Management University
publishDate 2015
url https://ink.library.smu.edu.sg/lkcsb_research/5147
https://ink.library.smu.edu.sg/context/lkcsb_research/article/6146/viewcontent/DynamicPricingHotelRooms_2015_wp.pdf
_version_ 1770573432912609280