首页    期刊浏览 2024年12月03日 星期二
登录注册

文章基本信息

  • 标题:Virtual Bidding: Equilibrium, Learning, and the Wisdom of Crowds * * Supported in part by NSF grants ECCS-1351621, CNS-1239178, IIP-1632124, US DoE under the CERTS initiative.
  • 本地全文:下载
  • 作者:Jonathan Mather ; Eilyan Bitar ; Kameshwar Poolla
  • 期刊名称:IFAC PapersOnLine
  • 印刷版ISSN:2405-8963
  • 出版年度:2017
  • 卷号:50
  • 期号:1
  • 页码:225-232
  • DOI:10.1016/j.ifacol.2017.08.038
  • 语种:English
  • 出版社:Elsevier
  • 摘要:AbstractWe present a theoretical analysis of virtual bidding in a stylized model of a single bus, two-settlement electricity market. North-American ISOs typically take a conservative approach to uncertainty, scheduling supply myopically in day-ahead (DA) markets to meet expected demand, neglecting the subsequent cost of recourse required to correct imbalances in the realtime (RT) market. This can result in generation costs that far exceed the minimum expected cost of supply. We explore the idea that virtual bidding can mitigate this excess cost incurred by myopic scheduling on the part of the ISO. Adopting a game-theoretic model of virtual bidding, we show that as the number of virtual bidders increases, the equilibrium market outcome tends to the socially optimal DA schedule, and prices converge between the DA and RT markets. We additionally analyze the effects of virtual bidding on social welfare and the variance of the price spread. Finally, we establish a repeated game formulation of virtual bidding, and investigate simple learning strategies for virtual bidders that guarantee convergence to the Nash equilibrium.
  • 关键词:KeywordsElectric Power SystemsGame TheoryEconomicsStochastic ProgrammingLearning AlgorithmsAsymptotic Analysis
国家哲学社会科学文献中心版权所有