Shapley Value Estimation for Compensation of Participants in Demand Response Programs

被引:61
作者
O'Brien, Gearoid [1 ]
El Gamal, Abbas [1 ]
Rajagopal, Ram [2 ]
机构
[1] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
[2] Stanford Univ, Dept Civil & Environm Engn, Stanford, CA 94305 USA
关键词
Economics; power system economics;
D O I
10.1109/TSG.2015.2402194
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Designing fair compensation mechanisms for demand response (DR) is challenging. This paper models the problem in a game theoretic setting and designs a payment distribution mechanism based on the Shapley value (SV). As exact computation of the SV is in general intractable, we propose estimating it using a reinforcement learning algorithm that approximates optimal stratified sampling. We apply this algorithm to a DR program that utilizes the SV for payments and quantify the accuracy of the resulting estimates.
引用
收藏
页码:2837 / 2844
页数:8
相关论文
共 24 条
[1]  
[Anonymous], 1971, Internat. J. Game Theory
[2]  
[Anonymous], 2011, ANN C INF SCI SYST C, DOI DOI 10.1109/CISS.2011.5766245
[3]  
[Anonymous], 105 CSEM WP U CAL EN
[4]  
[Anonymous], 1998, REINFORCEMENT LEARNI
[5]  
[Anonymous], INT C FUT EN SYST
[6]   Approximating power indices: theoretical and empirical analysis [J].
Bachrach, Yoram ;
Markakis, Evangelos ;
Resnick, Ezra ;
Procaccia, Ariel D. ;
Rosenschein, Jeffrey S. ;
Saberi, Amin .
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2010, 20 (02) :105-122
[7]  
Baeyens E, 2011, IEEE DECIS CONTR P, P3000
[8]   Polynomial calculation of the Shapley value based on sampling [J].
Castro, Javier ;
Gomez, Daniel ;
Tejada, Juan .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1726-1730
[9]   Real-Time Demand Response Model [J].
Conejo, Antonio J. ;
Morales, Juan M. ;
Baringo, Luis .
IEEE TRANSACTIONS ON SMART GRID, 2010, 1 (03) :236-242
[10]   Distributed Demand and Response Algorithm for Optimizing Social-Welfare in Smart Grid [J].
Dong, Qifen ;
Yu, Li ;
Song, Wen-Zhan ;
Tong, Lang ;
Tang, Shaojie .
2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2012, :1228-1239