计算机科学
业务
信息系统
信息技术
采购
运筹学
项目管理
经济
管理科学
风险分析(工程)
信息和通信技术
过程管理
产业组织
生产(经济)
营销
微观经济学
知识管理
调度(生产过程)
可靠性(半导体)
运营管理
作者
Himanshu Rathore,Sunil Tiwari
标识
DOI:10.1080/01605682.2025.2571064
摘要
In online retail, pricing policies are often implemented when the demand for a product is unknown. This stream of work is known as dynamic pricing with demand learning. Such dynamic pricing policies are usually based on resolving exploitation-exploration trade-offs prevalent in sequential decision-making under uncertainty. Should a price be revised based on the realised revenues in prior history, or should it be revised based on the promise of a better performance in the future? We examine whether prices should be selected solely based on apparent revenue consideration or should they also account for the behavioural underpinnings of the purchase intention. This paper proposes a data-driven dynamic pricing policy based on reinforcement learning that maximises revenues while incorporating the cumulative (un)fairness concerns based on customers’ prior experience with previous price revisions. Cumulative (un)fairness accumulates (un)fairness for all prior price revisions and is termed as ‘sticky’ fairness concerns. We find that the proposed policy favours implementing smaller prices compared to higher prices in realising higher revenues. We test this counterintuitive finding by conducting numerical and lab experiments in various demand settings. The proposed dynamic pricing policy demonstrates logarithmic regret in time.
科研通智能强力驱动
Strongly Powered by AbleSci AI