TY - GEN
T1 - Wind energy aggregation: A coalitional game approach
AU - Baeyens, E.
AU - Bitar, E.Y.
AU - Khargonekar, P.P.
AU - Poolla, K.
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): 025478
Acknowledgements: Supported in part by OOF991-KAUST US LIMITED under awardnumber 025478, the UC Discovery Grant ele07-10283 under the IMPACTprogram, NSF under Grant EECS-0925337, the Florida Energy SystemsConsortium, and Plan Nacional I+D+I of Spain under grant DPI2008-05795.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2011/12
Y1 - 2011/12
N2 - In this paper we explore the extent to which a group of N wind power producers can exploit the statistical benefits of aggregation and quantity risk sharing by forming a willing coalition to pool their variable power to jointly offer their aggregate power output as single entity into a forward energy market. We prove that wind power generators will always improve their expected profit when they aggregate their generated power and use tools from coalitional game theory to design fair sharing mechanisms to allocate the payoff among the coalition participants. We show that the corresponding coalitional game is super-additive and has a nonempty core. Hence, there always exists a mechanism for profit-sharing that makes the coalition stable. However, the game is not convex and the celebrated Shapley value may not belong to the core of the game. An allocation mechanism that minimizes the worst-case dissatisfaction is proposed. © 2011 IEEE.
AB - In this paper we explore the extent to which a group of N wind power producers can exploit the statistical benefits of aggregation and quantity risk sharing by forming a willing coalition to pool their variable power to jointly offer their aggregate power output as single entity into a forward energy market. We prove that wind power generators will always improve their expected profit when they aggregate their generated power and use tools from coalitional game theory to design fair sharing mechanisms to allocate the payoff among the coalition participants. We show that the corresponding coalitional game is super-additive and has a nonempty core. Hence, there always exists a mechanism for profit-sharing that makes the coalition stable. However, the game is not convex and the celebrated Shapley value may not belong to the core of the game. An allocation mechanism that minimizes the worst-case dissatisfaction is proposed. © 2011 IEEE.
UR - http://hdl.handle.net/10754/600196
UR - http://ieeexplore.ieee.org/document/6160785/
UR - http://www.scopus.com/inward/record.url?scp=84860694403&partnerID=8YFLogxK
U2 - 10.1109/CDC.2011.6160785
DO - 10.1109/CDC.2011.6160785
M3 - Conference contribution
SN - 9781612848013
SP - 3000
EP - 3007
BT - IEEE Conference on Decision and Control and European Control Conference
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -