Jema Sharin PankiRaj, A. Yassine, Salimur Choudhury
{"title":"Double-Sided Auction Mechanism for Peer-to-Peer Energy Trading Markets","authors":"Jema Sharin PankiRaj, A. Yassine, Salimur Choudhury","doi":"10.1109/PIC53636.2021.9687026","DOIUrl":null,"url":null,"abstract":"The emerging smart grid uniquely combines two-way communication and energy flow, allowing consumers to become active participants in market-based energy supply and demand strategies. In such a market, Peer-to-Peer (P2P) energy trading paradigm allows local communities and individuals who generate electricity to freely decide how and with whom they are going to trade it. The greatest challenge of P2P energy trading is how to design efficient mechanisms among rational participants that maximize their monetary benefits. Furthermore, since utility companies own the transmission lines, a key question that yet to be addressed in P2P markets is: how to match between different energy buyers and sellers while taking into account the physical constraints of the underlying grid infrastructure, e.g., capacity, congestion, and line transmission costs. This paper proposes a novel double-sided auction mechanism with a matching algorithm that addresses the aforementioned challenges. In this paper, the social welfare of the participants is modeled as an optimization problem with cost constraints incurred due to energy generation, operating and maintenance, capacity, and line transmission costs. The study provides theoretical analysis of the P2P auction model including mechanism design properties such as individual rationality, computational efficiency, and truthfulness. The results of the experiments indicate that the proposed auction model outperform existing systems and yields better economic incentives for participants.","PeriodicalId":297239,"journal":{"name":"2021 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Progress in Informatics and Computing (PIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC53636.2021.9687026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The emerging smart grid uniquely combines two-way communication and energy flow, allowing consumers to become active participants in market-based energy supply and demand strategies. In such a market, Peer-to-Peer (P2P) energy trading paradigm allows local communities and individuals who generate electricity to freely decide how and with whom they are going to trade it. The greatest challenge of P2P energy trading is how to design efficient mechanisms among rational participants that maximize their monetary benefits. Furthermore, since utility companies own the transmission lines, a key question that yet to be addressed in P2P markets is: how to match between different energy buyers and sellers while taking into account the physical constraints of the underlying grid infrastructure, e.g., capacity, congestion, and line transmission costs. This paper proposes a novel double-sided auction mechanism with a matching algorithm that addresses the aforementioned challenges. In this paper, the social welfare of the participants is modeled as an optimization problem with cost constraints incurred due to energy generation, operating and maintenance, capacity, and line transmission costs. The study provides theoretical analysis of the P2P auction model including mechanism design properties such as individual rationality, computational efficiency, and truthfulness. The results of the experiments indicate that the proposed auction model outperform existing systems and yields better economic incentives for participants.