.png){kind=icon}
返回
Accommodating Strategic Players in Distributed Algorithms for Power Dispatch Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2021.3085400.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distributed algorithms are gaining increasing research interests in the area of power system optimization and dispatch. Existing distributed power dispatch algorithms (DPDAs) usually assume that suppliers/consumers bid truthfully. However, this article shows the need for DPDAs to consider strategic players and to take account of their behavior deviation from what the DPDAs expect. To address this, we propose a distributed strategy update algorithm (DSUA) on top of a DPDA. The DSUA considers strategic suppliers who optimize their bids in a DPDA, using only the information accessible from a DPDA, that is, price. The DSUA also considers the cases when suppliers update bids alternately or simultaneously. Under both cases, we show the closeness of supplier bids to the Nash equilibrium via game-theoretic analysis as well as simulation.
Keyword:
Games
Nash equilibrium
Distributed algorithms
Cost function
Convergence
Analytical models
Time-domain analysis
Distributed algorithm
game theory
Nash equilibrium
neurodynamic optimization
strategic bidding
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Agent-Based Modeling in Electrical Energy Markets Using Dynamic Bayesian Networks使用动态贝叶斯网络在电能市场中基于代理的建模
PREAI
分享收藏
查看更多内容