Title :
Fast Computation of Pure Strategy Nash Equilibria in Electricity Markets Cleared by Merit Order
Author :
Hasan, Ebrahim ; Galiana, Francisco D.
Author_Institution :
Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC, Canada
fDate :
5/1/2010 12:00:00 AM
Abstract :
We consider an electricity market cleared by merit- order in which generating companies (Gencos) own any number of units and submit offers consisting of multiple blocks of finite generating capacity and constant incremental cost (IC). It has been shown that if the IC block offers can vary continuously, the market outcomes supported by pure strategy Nash equilibria (NE) are fewer than or equal to the number of Gencos and can all be computed through a mixed-integer linear programming (MILP) scheme. Knowledge of these NE then serves to study how an oligopolistic market of this type behaves under a variety of demand and market power conditions.
Keywords :
linear programming; power markets; ??-iterative approach; Nash equilibria; electricity markets; fast computation; finite generating capacity; generating companies; incremental cost; mixed-integer linear programming; oligopolistic market; Continuous incremental cost offers; electricity markets; fast computation of all Nash equilibria; merit order; pure strategy Nash equilibria;
Journal_Title :
Power Systems, IEEE Transactions on
DOI :
10.1109/TPWRS.2009.2037153