Improving the Scalability of a Prosumer Cooperative Game with K-Means Clustering

Liyang Han, Thomas Morstyn, Constance Crozier and Malcolm McCulloch

Papers from arXiv.org

Abstract: Among the various market structures under peer-to-peer energy sharing, one model based on cooperative game theory provides clear incentives for prosumers to collaboratively schedule their energy resources. The computational complexity of this model, however, increases exponentially with the number of participants. To address this issue, this paper proposes the application of K-means clustering to the energy profiles following the grand coalition optimization. The cooperative model is run with the "clustered players" to compute their payoff allocations, which are then further distributed among the prosumers within each cluster. Case studies show that the proposed method can significantly improve the scalability of the cooperative scheme while maintaining a high level of financial incentives for the prosumers.

Date: 2019-03, Revised 2020-07
New Economics Papers: this item is included in nep-cdm, nep-cmp, nep-ene and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in 2019 IEEE Milan PowerTech, Milan, Italy, 2019, pp. 1-6

Downloads: (external link)
http://arxiv.org/pdf/1903.10965 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1903.10965

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().