IDEAS home Printed from https://ideas.repec.org/a/eee/appene/v389y2025ics0306261925005197.html
   My bibliography  Save this article

Reliability assessment of multi-agent reinforcement learning algorithms for hybrid local electricity market simulation

Author

Listed:
  • Zhang, Haoyang
  • Qiu, Dawei
  • Kok, Koen
  • Paterakis, Nikolaos G.

Abstract

The reliability of data-driven multi-agent reinforcement learning (MARL) algorithms is a critical concern, particularly for complex, large-scale multi-agent decision-making problems. This paper aims to assess the reliability of various MARL algorithms in supporting decision-making for prosumer participants in a hybrid local electricity market (LEM) that combines community-based markets and a peer-to-peer (P2P) market. Specifically, it compares the performance of three MARL algorithms: the multi-agent deep deterministic policy gradient (MADDPG) algorithm and two advanced variants incorporating mean-field approximation and attention mechanisms. To evaluate the reliability of these data-driven MARL algorithms, a model-based bi-level optimization problem is introduced for each agent to assess convergence speed and the proximity of results to the ε-Nash equilibrium, as indicated by the no-regret index. The no-regret index is calculated within a mathematical program with equilibrium constraints (MPEC) by fixing the other agents’ behavior generated from the MARL algorithms. Simulation results demonstrate that the attention-MADDPG algorithm achieves the highest no-regret index (0.81), indicating convergence closest to equilibrium, and the greatest total cost reduction (983€), outperforming the other MARL algorithms. The mean-field-MADDPG algorithm is the most balanced, exhibiting robust convergence with the second-highest no-regret index (0.78) and cost reduction (958.8€) under the lowest computational burden (5.4 seconds per episode).

Suggested Citation

  • Zhang, Haoyang & Qiu, Dawei & Kok, Koen & Paterakis, Nikolaos G., 2025. "Reliability assessment of multi-agent reinforcement learning algorithms for hybrid local electricity market simulation," Applied Energy, Elsevier, vol. 389(C).
  • Handle: RePEc:eee:appene:v:389:y:2025:i:c:s0306261925005197
    DOI: 10.1016/j.apenergy.2025.125789
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0306261925005197
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.apenergy.2025.125789?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:appene:v:389:y:2025:i:c:s0306261925005197. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/405891/description#description .

    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.