TY - GEN
T1 - Efficient coordination of electric vehicle charging using a progressive second price auction
AU - Ma, Zhongjing
AU - Zou, Suli
AU - Liu, Xiangdong
AU - Hiskens, Ian
N1 - Publisher Copyright:
© 2015 American Automatic Control Council.
PY - 2015/7/28
Y1 - 2015/7/28
N2 - An auction-based game is formulated for coordinating the charging of a population of electric vehicles (EVs) over a finite horizon. The proposed auction requires individual EVs to submit bid profiles that have dimension equal to two times the number of time-steps in the horizon. They compete for energy allocation at each time-step. Use of the progressive second price (PSP) auction mechanism ensures that incentive compatibility holds for the auction game. However, due to cross-elasticity between the charging time-steps, the marginal valuation of an individual EV at a particular time is determined by both the demand at that time and the total demand over the entire horizon. This difficulty is addressed by partitioning the allowable set of bid profiles according to the total desired energy over the entire horizon. It is shown that the efficient bid profile over the charging horizon is a Nash equilibrium of the underlying auction game. A dynamic update mechanism for the auction game is designed. A numerical example demonstrates that the auction system converges to the efficient Nash equilibrium.
AB - An auction-based game is formulated for coordinating the charging of a population of electric vehicles (EVs) over a finite horizon. The proposed auction requires individual EVs to submit bid profiles that have dimension equal to two times the number of time-steps in the horizon. They compete for energy allocation at each time-step. Use of the progressive second price (PSP) auction mechanism ensures that incentive compatibility holds for the auction game. However, due to cross-elasticity between the charging time-steps, the marginal valuation of an individual EV at a particular time is determined by both the demand at that time and the total demand over the entire horizon. This difficulty is addressed by partitioning the allowable set of bid profiles according to the total desired energy over the entire horizon. It is shown that the efficient bid profile over the charging horizon is a Nash equilibrium of the underlying auction game. A dynamic update mechanism for the auction game is designed. A numerical example demonstrates that the auction system converges to the efficient Nash equilibrium.
UR - http://www.scopus.com/inward/record.url?scp=84940935550&partnerID=8YFLogxK
U2 - 10.1109/ACC.2015.7171793
DO - 10.1109/ACC.2015.7171793
M3 - Conference contribution
AN - SCOPUS:84940935550
T3 - Proceedings of the American Control Conference
SP - 2999
EP - 3006
BT - ACC 2015 - 2015 American Control Conference
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2015 American Control Conference, ACC 2015
Y2 - 1 July 2015 through 3 July 2015
ER -