IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v242y2026icp323-342.html

A master-slave game based shared energy storage time-of-use pricing strategy under blockchain technology

Author

Listed:
  • Li, Wanying
  • Dong, Fugui
  • Ji, Zhengsen
  • Du, Ruoyun

Abstract

To address the current problems of low energy storage utilization efficiency and income, this study first designs a smart contract-based shared energy storage (SES) framework, which specifies the transaction mechanisms among the grid, user aggregator, new energy aggregator, and SES service provider. Second, a master-slave game model is established with the SES service provider as the leader and the user aggregator, and new energy aggregator as the followers. A master-multi-slave Stackelberg game time-of-use pricing solution is proposed. Finally, arithmetic simulation and multi-scenario, multi-method comparative analysis are performed to optimize the strategies of each subject using the improved genetic algorithm combined with the Gurobi solver. The results show that blockchain technology can effectively support SES service providers to realize time-of-use pricing transactions. With time-of-use pricing, the profit of the SES service provider can reach 22508 yuan, which is better than single pricing of 4648 yuan, and also improves the profits of the user aggregator and new energy aggregator. More profit is made when the initial state of the storage unit is low. 10 %-15 % of shared storage configurations are the most profitable in terms of unit size. For time-of-use pricing problem, the improved genetic algorithm outperforms particle swarm and gray wolf algorithms.

Suggested Citation

  • Li, Wanying & Dong, Fugui & Ji, Zhengsen & Du, Ruoyun, 2026. "A master-slave game based shared energy storage time-of-use pricing strategy under blockchain technology," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 242(C), pages 323-342.
  • Handle: RePEc:eee:matcom:v:242:y:2026:i:c:p:323-342
    DOI: 10.1016/j.matcom.2025.12.002
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2025.12.002?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:matcom:v:242:y:2026:i:c:p:323-342. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.