A homogeneous group bargaining algorithm in a smart grid
- Authors
- Yu, Mengmeng; Hong, Seung ho; Wei, Min; Xu, Aidong
- Issue Date
- May-2013
- Publisher
- IEEE
- Keywords
- group bargaining; homogeneous; representative; smart grid; utility
- Citation
- 2013 Workshop on Modeling and Simulation of Cyber-Physical Energy Systems (MSCPES), pp 1 - 6
- Pages
- 6
- Indexed
- SCOPUS
- Journal Title
- 2013 Workshop on Modeling and Simulation of Cyber-Physical Energy Systems (MSCPES)
- Start Page
- 1
- End Page
- 6
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/28366
- DOI
- 10.1109/MSCPES.2013.6623323
- Abstract
- In this paper, we consider a smart grid incorporating numerous devices. In order to manage the energy distribution, we propose an algorithm that employs the group bargaining concept of game theory to efficiently allocate electricity resources among these devices. First, we divide the devices into non-overlapping groups, and allow devices to bargain both within and across groups. Second, we regard each group as homogeneous, so that the bargaining authority can be delegated to a representative device. Thus, the bargaining problem involves only the representatives, each of which bargains with other representatives on behalf of the group it belongs to. Third, we compare various bargaining results via a utility function that indicates the satisfaction level of a representative in terms of the bargaining result. Finally, the algorithm determines the optimal resource distribution pattern by maximizing the aggregated utilities of all representatives. Simulation results show that the proposed algorithm can reduce the complexity of energy distribution by distinguishing between inter- and intra-group bargaining processes, and can efficiently allocate resources to various devices according to their actual requirements. © 2013 IEEE.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.