A Tale of Two Cities: Pessimism and Opportunism in Offline Dynamic Pricing

Zeyu Bian, Zhengling Qi, Cong Shi, Lan Wang
11/12/2024
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

This paper studies offline dynamic pricing without data coverage assumption, thereby allowing for any price including the optimal one not being observed in the offline data. Previous approaches that rely on the various coverage assumptions such as that the optimal prices are observable, would lead to suboptimal decisions and consequently, reduced profits. We address this challenge by framing the problem to a partial identification framework. Specifically, we establish a partial identification bound for the demand parameter whose associated price is unobserved by leveraging the inherent monotonicity property in the pricing problem. We further incorporate pessimistic and opportunistic strategies within the proposed partial identification framework to derive the estimated policy. Theoretically, we establish rate-optimal finite-sample regret guarantees for both strategies. Empirically, we demonstrate the superior performance of the newly proposed methods via a synthetic environment. This research provides practitioners with valuable insights into offline pricing strategies in the challenging no-coverage setting, ultimately fostering sustainable growth and profitability of the company.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bian2024tale,
  title  = {A Tale of Two Cities: Pessimism and Opportunism in Offline Dynamic Pricing},
  author = {Zeyu Bian and Zhengling Qi and Cong Shi and Lan Wang},
  year   = {2024},
  eprint = {2411.08126},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.08126v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.08126.svg)](https://codeofpaper.com/paper/2411.08126)

Discussion