Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3580507.3597668acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
extended-abstract

Temporal Fairness in Learning and Earning: Price Protection Guarantee and Phase Transitions

Published: 07 July 2023 Publication History

Abstract

Motivated by the prevalence of "price protection guarantee", which helps to promote temporal fairness in dynamic pricing, we study the impact of such policy on the design of online learning algorithm for data-driven dynamic pricing with initially unknown customer demand. Under the price protection guarantee, a customer who purchased a product in the past can receive a refund from the seller during the so-called price protection period (typically defined as a certain time window after the purchase date) in case the seller decides to lower the price. We consider a setting where a firm sells a product over a horizon of T time steps. For this setting, we characterize how the value of M, the length of price protection period, can affect the optimal regret of the learning process. Our contributions can be summarized as follows:
Inadequacy of Existing Algoirthms: We demonstrate that directly applying conventional dynamic pricing algorithms, such Upper Confidence Bound (UCB) algorithm and Thompson Sampling (TS) algorithm, may incur linear regret in the presence of price protection. We use both theoretical and numerical evidences to support this claim;
Regret Lower and Upper Bounds: We show that the optimal regret is [EQUATION] by first establishing a fundamental impossible regime with the novel refund-aware regret lower bound analysis. Then, we propose LEAP, a phased exploration type algorithm for Learning and EArning under Price Protection to match this lower bound up to logarithmic factors or even doubly logarithmic factors (when there are only two prices available to the seller);
Phase Transitions of Optimal Regret: Our results reveal the surprising phase transitions of the optimal regret with respect to M. Specifically, when M is not too large, the optimal regret has no major difference when compared to that of the classic setting with no price protection guarantee. We also show that there exists an upper limit on how much the optimal regret can deteriorate when M grows large;
Numerical Simulations: Finally, we conduct extensive numerical experiments to show the benefit of LEAP over other heuristic methods for this problem.

Index Terms

  1. Temporal Fairness in Learning and Earning: Price Protection Guarantee and Phase Transitions
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    EC '23: Proceedings of the 24th ACM Conference on Economics and Computation
    July 2023
    1253 pages
    ISBN:9798400701047
    DOI:10.1145/3580507
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 07 July 2023

    Check for updates

    Qualifiers

    • Extended-abstract

    Conference

    EC '23
    Sponsor:
    EC '23: 24th ACM Conference on Economics and Computation
    July 9 - 12, 2023
    London, United Kingdom

    Acceptance Rates

    Overall Acceptance Rate 664 of 2,389 submissions, 28%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 67
      Total Downloads
    • Downloads (Last 12 months)35
    • Downloads (Last 6 weeks)4
    Reflects downloads up to 16 Nov 2024

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media