Can planners control competitive generators?
Consider an electricity market populated by competitive agents using thermal generating units. Generation often emits pollution which a planner may wish to constrain through regulation. Furthermore, generators’ ability to transmit energy may be naturally restricted by the grid’s facilities. The existence of both pollution standards and transmission constraints can impose several restrictions upon the joint strategy space of the agents. We propose a dynamic, game-theoretic model capable of analysing coupled constraints equilibria (also known as generalised Nash equilibria). Our equilibria arise as solutions to the planner’s problem of avoiding both network congestion and excessive pollution. The planner can use the coupled constraints’ Lagrange multipliers to compute the charges the players would pay if the constraints were violated. Once the players allow for the charges in their objective functions they will feel compelled to obey the constraints in equilibrium. However, a coupled constraints equilibrium needs to exist and be unique for this modiﬁcation of the players’ objective functions ..[there was a “to” here, incorrect?].. induce the required behaviour. We extend the three-node dc model with transmission line constraints described in  and  to utilise a two-period load duration curve, and impose multi-period pollution constraints. We discuss the economic and environmental implications of the game’s solutions as we vary the planner’s preferences.
|Date of creation:||30 Aug 2008|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Steffan Berridge & Jacek Krawczyk, "undated".
"Relaxation Algorithms in Finding Nash Equilibrium,"
Computing in Economics and Finance 1997
159, Society for Computational Economics.
- Jacek B. Krawczyk & Steffan Berridge, 1997. "Relaxation Algorithms in Finding Nash Equilibria," Computational Economics 9707002, EconWPA.
- Krawczyk, Jacek & Zuccollo, James, 2006. "NIRA-3: An improved MATLAB package for finding Nash equilibria in infinite games," MPRA Paper 1119, University Library of Munich, Germany.
- Jacek Krawczyk, 2007. "Numerical solutions to coupled-constraint (or generalised Nash) equilibrium problems," Computational Management Science, Springer, vol. 4(2), pages 183-204, April.
- Krawczyk, Jacek B., 2005. "Coupled constraint Nash equilibria in environmental games," Resource and Energy Economics, Elsevier, vol. 27(2), pages 157-181, June. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:10395. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.