Agent-based simulation of power exchange with heterogeneous production companies
Since early nineties, worldwide production and distribution of electricity has been characterized by a progressive liberalization. The state-owned monopolistic production of electricity has been substituted by organized power exchanges (PEs). PEs are markets which aggregate the effective supply and demand of electricity. Usually spot-price market are Day Ahead Market (DAM) and are requested in order to provide an indication for the hourly unit commitment. This first session of the complex daily energy market collects and orders all the offers, determining the market price by matching the cumulative demand and supply curves for every hour of the day after according to a merit order rule. Subsequent market sessions (also online) operate in order to guarantee the feasibility and the security of this plan. The electric market is usually characterized by a reduced number of competitors, thus oligopolistic scenario may arise. Understanding how electricity prices depend on oligopolistic behavior of suppliers and on production costs has become a very important issue. Several restructuring designs for the electric power industry have been proposed. Main goal is to increase the overall market efficiency, trying to study, to develop and to apply different market mechanisms. Auction design is the standard domain for commodity markets. However, properties of different auction mechanism must be studied and determined correctly before their appliance. Generally speaking, different approaches have been proposed in the literature. Game theory analysis has provided an extremely useful methodology to study and derive properties of economic "games", such as auctions. Within this context, an interesting computational approach, for studying market inefficiencies, is the theory of learning in games. This methodology is useful in the context of infinitely repeated games. This paper investigates the nature of the clearing mechanism comparing two different methods, i.e., discriminatory and uniform auctions. The theoretical framework used to perform the analysis is the theory of learning in games. We consider an inelastic demand faced by sellers which use learning algorithms to understand proper strategies for increasing their profits. We model the auction mechanism in two different duopolistic scenario, i.e., a low demand situation, where one seller can clear all the demand, and a high demand condition, where both sellers are requested. Moreover, heterogeneity in the linear cost function is considered. Consistent results are achieved with two different learning algorithms
|Date of creation:||11 Nov 2005|
|Date of revision:|
|Contact details of provider:|| Web page: http://comp-econ.org/|
More information through EDIRC
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.:
- Erev, Ido & Roth, Alvin E, 1998. "Predicting How People Play Games: Reinforcement Learning in Experimental Games with Unique, Mixed Strategy Equilibria," American Economic Review, American Economic Association, vol. 88(4), pages 848-81, September.
- James Nicolaisen & Valentin Petrov & Leigh Tesfatsion, 2000.
"Market Power and Efficiency in a Computational Electricity Market with Discriminatory Double-Auction Pricing,"
- Nicolaisen, James & Petrov, Valentin & Tesfatsion, Leigh S., 2001. "Market Power and Efficiency in a Computational Electricity Market with Discriminatory Double-Auction Pricing," Staff General Research Papers 2050, Iowa State University, Department of Economics.
- Nicolaisen, James & Petrov, Valentin & Tesfatsion, Leigh S., 2000. "Market Power and Efficiency in a Computational Electricity Market with Discriminatory Double-Auction Pricing," Staff General Research Papers 1952, Iowa State University, Department of Economics.
- Paul Klemperer, 1999.
"Auction Theory: A Guide to the Literature,"
Economics Series Working Papers
1999-W12, University of Oxford, Department of Economics.
- Klemperer, P., 1999. "Auction Theory: a Guide to the Literature," Economics Papers 1999-w12, Economics Group, Nuffield College, University of Oxford.
- Paul Klemperer, 1999. "Auction Theory: A Guide to the Literature," Microeconomics 9903002, EconWPA.
- Klemperer, Paul, 1999. "Auction Theory: a Guide to the Literature," CEPR Discussion Papers 2163, C.E.P.R. Discussion Papers.
- Guerci, E. & Ivaldi, S. & Pastore, S. & Cincotti, S., 2005. "Modeling and implementation of an artificial electricity market using agent-based technology," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 355(1), pages 69-76.
- Denton, Michael J. & Rassenti, Stephen J. & Smith, Vernon L., 2001. "Spot market mechanism design and competitivity issues in electric power," Journal of Economic Behavior & Organization, Elsevier, vol. 44(4), pages 435-453, April.
- Fudenberg, Drew & Levine, David, 1998.
"Learning in games,"
European Economic Review,
Elsevier, vol. 42(3-5), pages 631-639, May.
- Von der Fehr, N.H.M. & Harbord, D., 1992.
"Spot Market Competition in the UK Electricity Industry,"
09/1992, Oslo University, Department of Economics.
- von der Fehr, Nils-Henrik Morch & Harbord, David, 1993. "Spot Market Competition in the UK Electricity Industry," Economic Journal, Royal Economic Society, vol. 103(418), pages 531-46, May.
- Vega-Redondo,Fernando, 2003.
"Economics and the Theory of Games,"
Cambridge University Press, number 9780521775908, January.
- A. Roth & I. Er’ev, 2010. "Learning in Extensive Form Games: Experimental Data and Simple Dynamic Models in the Intermediate Run," Levine's Working Paper Archive 387, David K. Levine.
When requesting a correction, please mention this item's handle: RePEc:sce:scecf5:334. 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: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.