IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2508.02630.html

What Is Your AI Agent Buying? Evaluation, Biases, Model Dependence, & Emerging Implications for Agentic E-Commerce

Author

Listed:
  • Amine Allouah
  • Omar Besbes
  • Josu'e D Figueroa
  • Yash Kanoria
  • Akshit Kumar

Abstract

Online marketplaces will be transformed by autonomous AI agents acting on behalf of consumers. Rather than humans browsing and clicking, AI agents can parse webpages or leverage APIs to view, evaluate and choose products. We investigate the behavior of AI agents using ACES, a provider-agnostic framework for auditing agent decision-making. We reveal that agents can exhibit choice homogeneity, often concentrating demand on a few ``modal'' products while ignoring others entirely. Yet, these preferences are unstable: model updates can drastically reshuffle market shares. Furthermore, randomized trials show that while agents have improved over time on simple tasks with a clearly identified best choice, they exhibit strong position biases -- varying across providers and model versions, and persisting even in text-only "headless" interfaces -- undermining any universal notion of a ``top'' rank. Agents also consistently penalize sponsored tags while rewarding platform endorsements, and sensitivities to price, ratings, and reviews vary sharply across models. Finally, we demonstrate that sellers can respond: a seller-side agent making simple, query-conditional description tweaks can drive significant gains in market share. These findings reveal that agentic markets are volatile and fundamentally different from human-centric commerce, highlighting the need for continuous auditing and raising questions for platform design, seller strategy and regulation.

Suggested Citation

  • Amine Allouah & Omar Besbes & Josu'e D Figueroa & Yash Kanoria & Akshit Kumar, 2025. "What Is Your AI Agent Buying? Evaluation, Biases, Model Dependence, & Emerging Implications for Agentic E-Commerce," Papers 2508.02630, arXiv.org, revised Dec 2025.
  • Handle: RePEc:arx:papers:2508.02630
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Vineet Goyal & Retsef Levi & Danny Segev, 2016. "Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand," Operations Research, INFORMS, vol. 64(1), pages 219-235, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shengyu Cao & Ming Hu, 2026. "A Solicit-Then-Suggest Model of Agentic Purchasing," Papers 2603.20972, arXiv.org.
    2. Peyman Shahidi & Gili Rusak & Benjamin S. Manning & Andrey Fradkin & John J. Horton, 2025. "The Coasean Singularity? Demand, Supply, and Market Design with AI Agents," NBER Chapters, in: The Economics of Transformative AI, pages 145-165, National Bureau of Economic Research, Inc.

    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.
    1. Mou, Shandong & Robb, David J. & DeHoratius, Nicole, 2018. "Retail store operations: Literature review and research directions," European Journal of Operational Research, Elsevier, vol. 265(2), pages 399-422.
    2. Markus Ettl & Pavithra Harsha & Anna Papush & Georgia Perakis, 2020. "A Data-Driven Approach to Personalized Bundle Pricing and Recommendation," Manufacturing & Service Operations Management, INFORMS, vol. 22(3), pages 461-480, May.
    3. Laurent Alfandari & Alborz Hassanzadeh & Ivana Ljubić, 2021. "An Exact Method for Assortment Optimization under the Nested Logit Model," Working Papers hal-02463159, HAL.
    4. Woonghee Tim Huh & Joseph Paat & Maurice Queyranne, 2026. "Performance of the Offer-Everything Policy," Operations Research, INFORMS, vol. 74(1), pages 141-160, January.
    5. Vasilyev, Andrey & Maier, Sebastian & Seifert, Ralf W., 2025. "Optimizing omnichannel assortments and inventory provisions under the multichannel attraction model," European Journal of Operational Research, Elsevier, vol. 324(3), pages 799-813.
    6. Yi-Chun Akchen & Felipe Caro, 2026. "On Size Substitution and Its Role in Assortment and Inventory Planning," Manufacturing & Service Operations Management, INFORMS, vol. 28(2), pages 624-642, March.
    7. Transchel, Sandra, 2017. "Inventory management under price-based and stockout-based substitution," European Journal of Operational Research, Elsevier, vol. 262(3), pages 996-1008.
    8. Jingwei Zhang & Will Ma & Huseyin Topaloglu, 2025. "Technical Note—Leveraging the Degree of Dynamic Substitution in Assortment and Inventory Planning," Operations Research, INFORMS, vol. 73(3), pages 1248-1259, May.
    9. Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "Dynamic Assortment Optimization for Reusable Products with Random Usage Durations," Management Science, INFORMS, vol. 66(7), pages 2820-2844, July.
    10. Arhami, Omid & Aslani, Shirin & Talebian, Masoud, 2024. "Dynamic assortment planning and capacity allocation with logit substitution," Journal of Retailing and Consumer Services, Elsevier, vol. 76(C).
    11. Balasooriya, Maduka & Dalkiran, Evrim & Chinnam, Ratna Babu, 2025. "Impact of distribution channel dynamics on automotive assortment planning," International Journal of Production Economics, Elsevier, vol. 283(C).
    12. Zhang, Juliang & Deng, Lan & Liu, Huimin & Cheng, T.C.E., 2022. "Which strategy is better for managing multi-product demand uncertainty: Inventory substitution or probabilistic selling?," European Journal of Operational Research, Elsevier, vol. 302(1), pages 79-95.
    13. Xingxing Chen & Jacob Feldman & Seung Hwan Jung & Panos Kouvelis, 2022. "Approximation schemes for the joint inventory selection and online resource allocation problem," Production and Operations Management, Production and Operations Management Society, vol. 31(8), pages 3143-3159, August.
    14. Alok Baveja & Amit Chavan & Andrei Nikiforov & Aravind Srinivasan & Pan Xu, 2025. "Technical Note—Improved Sample-Complexity Bounds in Stochastic Optimization," Operations Research, INFORMS, vol. 73(2), pages 986-994, March.
    15. Ali Aouad & Danny Segev, 2023. "The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications," Operations Research, INFORMS, vol. 71(4), pages 1216-1249, July.
    16. Alfandari, Laurent & Hassanzadeh, Alborz & Ljubic, Ivana, 2020. "An Exact Method for Assortment Optimization under the Nested Logit Model," ESSEC Working Papers WP2001, ESSEC Research Center, ESSEC Business School, revised 2020.
    17. Hekimoğlu, Mustafa & Sevim, Ismail & Aksezer, Çağlar & Durmuş, İpek, 2019. "Assortment optimization with log-linear demand: Application at a Turkish grocery store," Journal of Retailing and Consumer Services, Elsevier, vol. 50(C), pages 199-214.
    18. Amr Farahat & Joonkyum Lee, 2018. "The Multiproduct Newsvendor Problem with Customer Choice," Operations Research, INFORMS, vol. 66(1), pages 123-136, January.
    19. Arash Asadpour & Rad Niazadeh & Amin Saberi & Ali Shameli, 2023. "Sequential Submodular Maximization and Applications to Ranking an Assortment of Products," Operations Research, INFORMS, vol. 71(4), pages 1154-1170, July.
    20. Guodong Lyu & Chung-Piaw Teo, 2022. "Last Mile Innovation: The Case of the Locker Alliance Network," Manufacturing & Service Operations Management, INFORMS, vol. 24(5), pages 2425-2443, September.

    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:2508.02630. 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: https://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.