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

Tacit algorithmic collusion in deep reinforcement learning guided price competition: A study using EV charge pricing game

Author

Listed:
  • Diwas Paudel
  • Tapas K. Das

Abstract

Players in pricing games with complex structures are increasingly adopting artificial intelligence (AI) aided learning algorithms to make pricing decisions for maximizing profits. This is raising concern for the antitrust agencies as the practice of using AI may promote tacit algorithmic collusion among otherwise independent players. Recent studies of games in canonical forms have shown contrasting claims ranging from none to a high level of tacit collusion among AI-guided players. In this paper, we examine the concern for tacit collusion by considering a practical game where EV charging hubs compete by dynamically varying their prices. Such a game is likely to be commonplace in the near future as EV adoption grows in all sectors of transportation. The hubs source power from the day-ahead (DA) and real-time (RT) electricity markets as well as from in-house battery storage systems. Their goal is to maximize profits via pricing and efficiently managing the cost of power usage. To aid our examination, we develop a two-step data-driven methodology. The first step obtains the DA commitment by solving a stochastic model. The second step generates the pricing strategies by solving a competitive Markov decision process model using a multi-agent deep reinforcement learning (MADRL) framework. We evaluate the resulting pricing strategies using an index for the level of tacit algorithmic collusion. An index value of zero indicates no collusion (perfect competition) and one indicates full collusion (monopolistic behavior). Results from our numerical case study yield collusion index values between 0.14 and 0.45, suggesting a low to moderate level of collusion.

Suggested Citation

  • Diwas Paudel & Tapas K. Das, 2024. "Tacit algorithmic collusion in deep reinforcement learning guided price competition: A study using EV charge pricing game," Papers 2401.15108, arXiv.org, revised May 2024.
  • Handle: RePEc:arx:papers:2401.15108
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Arnoud V. den Boer & Janusz M. Meylahn & Maarten Pieter Schinkel, 2022. "Artificial Collusion: Examining Supracompetitive Pricing by Q-learning Algorithms," Tinbergen Institute Discussion Papers 22-067/VII, Tinbergen Institute.
    2. Emilio Calvano & Giacomo Calzolari & Vincenzo Denicolò & Sergio Pastorello, 2020. "Artificial Intelligence, Algorithmic Pricing, and Collusion," American Economic Review, American Economic Association, vol. 110(10), pages 3267-3297, October.
    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.
    1. Thomas Loots & Arnoud V. den Boer, 2023. "Data‐driven collusion and competition in a pricing duopoly with multinomial logit demand," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1169-1186, April.
    2. Dolgopolov, Arthur, 2024. "Reinforcement learning in a prisoner's dilemma," Games and Economic Behavior, Elsevier, vol. 144(C), pages 84-103.
    3. Shi, Ziyi & Xu, Meng & Song, Yancun & Zhu, Zheng, 2024. "Multi-Platform dynamic game and operation of hybrid Bike-Sharing systems based on reinforcement learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    4. Inkoo Cho & Noah Williams, 2024. "Collusive Outcomes Without Collusion," Papers 2403.07177, arXiv.org.
    5. Kopalle, Praveen K. & Pauwels, Koen & Akella, Laxminarayana Yashaswy & Gangwar, Manish, 2023. "Dynamic pricing: Definition, implications for managers, and future research directions," Journal of Retailing, Elsevier, vol. 99(4), pages 580-593.
    6. Ding, Shasha & Sun, Hao & Sun, Panfei & Han, Weibin, 2022. "Dynamic outcome of coopetition duopoly with implicit collusion," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    7. Daníelsson, Jón & Macrae, Robert & Uthemann, Andreas, 2022. "Artificial intelligence and systemic risk," Journal of Banking & Finance, Elsevier, vol. 140(C).
    8. Soria, Jorge & Moya, Jorge & Mohazab, Amin, 2023. "Optimal mining in proof-of-work blockchain protocols," Finance Research Letters, Elsevier, vol. 53(C).
    9. Zhijun Chen & pch346 & Chongwoo Choe & Jiajia Cong & Noriaki Matsushima, 2020. "Data-Driven Mergers and Personalization," Monash Economics Working Papers 16-20, Monash University, Department of Economics.
    10. Böheim, René & Hackl, Franz & Hölzl-Leitner, Michael, 2021. "The impact of price adjustment costs on price dispersion in e-commerce," International Journal of Industrial Organization, Elsevier, vol. 77(C).
    11. Emilio Calvano & Giacomo Calzolari & Vincenzo Denicolò & Sergio Pastorello, 2019. "Algorithmic Pricing What Implications for Competition Policy?," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 55(1), pages 155-171, August.
    12. Bingyan Han, 2021. "Understanding algorithmic collusion with experience replay," Papers 2102.09139, arXiv.org, revised Mar 2021.
    13. Marcel Wieting & Geza Sapi, 2021. "Algorithms in the Marketplace: An Empirical Analysis of Automated Pricing in E-Commerce," Working Papers 21-06, NET Institute.
    14. Yiquan Gu & Leonardo Madio & Carlo Reggiani, 2019. "Exclusive Data, Price Manipulation and Market Leadership," CESifo Working Paper Series 7853, CESifo.
    15. Martino Banchio & Giacomo Mantegazza, 2022. "Artificial Intelligence and Spontaneous Collusion," Papers 2202.05946, arXiv.org, revised Sep 2023.
    16. Zengqing Wu & Run Peng & Xu Han & Shuyuan Zheng & Yixin Zhang & Chuan Xiao, 2023. "Smart Agent-Based Modeling: On the Use of Large Language Models in Computer Simulations," Papers 2311.06330, arXiv.org, revised Dec 2023.
    17. Stefano Colombo & Aldo Pignataro, 2022. "Information accuracy and collusion," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 31(3), pages 638-656, August.
    18. Martin, Ian W.R. & Nagel, Stefan, 2022. "Market efficiency in the age of big data," Journal of Financial Economics, Elsevier, vol. 145(1), pages 154-177.
    19. Tan, Changchun & Mo, Lingyu & Wu, Xiaomeng & Zhou, Peng, 2024. "Fintech development and corporate credit risk: Evidence from an emerging market," International Review of Financial Analysis, Elsevier, vol. 92(C).
    20. Jens Prüfer & Patricia Prüfer, 2020. "Data science for entrepreneurship research: studying demand dynamics for entrepreneurial skills in the Netherlands," Small Business Economics, Springer, vol. 55(3), pages 651-672, October.

    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:2401.15108. 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.