Competitive analysis of online revenue management with two hierarchical resources and multiple fare classes

Author:

Ni GuanqunORCID

Abstract

Resource allocation problem is one of key issues in the field of revenue management. The traditional models usually rely on some restrictive assumptions about demand information or arrival process, which is sometimes out of line with reality. To overcome this shortcoming, the method of competitive analysis of online algorithms, which eliminates the need for the assumptions on demand and arrivals, is adopted to deal with the quantity-based revenue management problem. The current model in this paper considers two downgrade compatible levels of resources. Given the capacities and fares of both levels of resources, the objective is to accept appropriate customers and assign them to appropriate resources so as to maximize revenues. Compared with the existing literature, this paper generalizes the concerned resource allocation problem by considering multiple fares for each level of resources. From the perspective of online algorithms and competitive analysis, both an upper bound and an optimal online strategy are derived in this paper.

Funder

the MOE Layout Foundation of Humanities and Social Sciences

Startup Program of Doctor Scientific Research in Shandong University of Technology

Publisher

Public Library of Science (PLoS)

Subject

Multidisciplinary

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3