IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2405.10469.html
   My bibliography  Save this paper

Simulation-Based Benchmarking of Reinforcement Learning Agents for Personalized Retail Promotions

Author

Listed:
  • Yu Xia
  • Sriram Narayanamoorthy
  • Zhengyuan Zhou
  • Joshua Mabry

Abstract

The development of open benchmarking platforms could greatly accelerate the adoption of AI agents in retail. This paper presents comprehensive simulations of customer shopping behaviors for the purpose of benchmarking reinforcement learning (RL) agents that optimize coupon targeting. The difficulty of this learning problem is largely driven by the sparsity of customer purchase events. We trained agents using offline batch data comprising summarized customer purchase histories to help mitigate this effect. Our experiments revealed that contextual bandit and deep RL methods that are less prone to over-fitting the sparse reward distributions significantly outperform static policies. This study offers a practical framework for simulating AI agents that optimize the entire retail customer journey. It aims to inspire the further development of simulation tools for retail AI systems.

Suggested Citation

  • Yu Xia & Sriram Narayanamoorthy & Zhengyuan Zhou & Joshua Mabry, 2024. "Simulation-Based Benchmarking of Reinforcement Learning Agents for Personalized Retail Promotions," Papers 2405.10469, arXiv.org.
    • Handle: RePEc:arx:papers:2405.10469
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2405.10469
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yu Xia & Ali Arian & Sriram Narayanamoorthy & Joshua Mabry, 2023. "RetailSynth: Synthetic Data Generation for Retail AI Systems Evaluation," Papers 2312.14095, arXiv.org.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      NEP fields

      This paper has been announced in the following NEP Reports:

      Statistics

      Access and download statistics

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2405.10469. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.