Optimal combinatorial electricity markets

The deregulation of the electricity industry in many countries has created a number of marketplaces in which producers and consumers can operate in order to more effectively manage and meet their energy needs. To this end, this paper develops a new model for electricity retail where end-use customers choose their supplier from competing electricity retailers. The model is based on simultaneous reverse combinatorial auctions, designed as a second-price sealed-bid multi-item auction with supply function bidding. This model prevents strategic bidding and allows the auctioneer to maximise its pay-off. Furthermore, we develop optimal single-item and multi-item algorithms for winner determination in such auctions that are significantly less complex than those currently available in the literature.

[1]  Anany Levitin,et al.  Introduction to the Design and Analysis of Algorithms , 2002 .

[2]  Lawrence M. Ausubel,et al.  The Lovely but Lonely Vickrey Auction , 2004 .

[3]  David C. Parkes,et al.  iBundle: an efficient ascending price bundle auction , 1999, EC '99.

[4]  Mark M. Bykowsky,et al.  Mutually Destructive Bidding: The FCC Auction Design Problem , 2000 .

[5]  Thomas Sandholm,et al.  Making Markets and Democracy Work: A Story of Incentives and Computing , 2003, IJCAI.

[6]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[7]  Hans Akkermans,et al.  Resource-Oriented Multicommodity Market Algorithms , 2000, Autonomous Agents and Multi-Agent Systems.

[8]  Rune Gustavsson,et al.  HOMEBOTS : Intelligent Decentralized Services for Energy Management , 1996 .

[9]  Nicholas R. Jennings,et al.  Resource allocation in communication networks using market-based agents , 2005, Knowl. Based Syst..

[10]  Nicholas R. Jennings,et al.  Computational-Mechanism Design: A Call to Arms , 2003, IEEE Intell. Syst..

[11]  Mark Allen Weiss.  Data Structures and Problem Solving Using Java (3rd Edition) , 2005 .

[12]  Rune Gustavsson,et al.  Agents with power , 1999, CACM.

[13]  J. M. Akkermans,et al.  The HomeBots System and Field Test - A Multi-Commodity Market for Predictive Power Load Management, , 1999 .

[14]  A. Tversky,et al.  On the psychology of prediction , 1973 .

[15]  Moshe Tennenholtz,et al.  An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.

[16]  Subhash Suri,et al.  Market Clearability , 2001, IJCAI.

[17]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[18]  Moshe Tennenholtz.  Some Tractable Combinatorial Auctions , 2000, AAAI/IAAI.

[19]  Ramgopal R. Mettu,et al.  Approximation algorithms for np -hard clustering problems , 2002 .

[20]  Mark Allen Weiss.  Data structures and problem solving using Java , 1998, SIGA.

[21]  F. Ygge,et al.  Duality in Multi-Commodity Market Computations , 1997 .

[22]  A. Tversky,et al.  Prospect Theory : An Analysis of Decision under Risk Author ( s ) : , 2007 .

[23]  Hans Akkermans,et al.  Power Load Management as a Computational Market , 1996 .

[24]  Hans Akkermans,et al.  Smart Software as Costumer Assistant in Large-Scale Distributed Load Management , 1997 .

[25]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[26]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[27]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[28]  Noam Nisan,et al.  Bidding and allocation in combinatorial auctions , 2000, EC '00.

[29]  Nicholas R. Jennings,et al.  An Optimal Distributed Constraint Optimisation Algorithm for Efficient Energy Management , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[30]  A. Tversky,et al.  Choices, Values, and Frames , 2000 .

[31]  P. Palensky,et al.  Heim- und Gebäudeautomatisierung zur Effizienzsteigerung in Gebäuden , 2003 .

[32]  James E. Hanson,et al.  Price-war dynamics in a free-market economy of software agents , 1998 .

[33]  R. Haas,et al.  Die kalifornische Stromkrise , 2001 .

[34]  Maria L. Gini,et al.  Scheduling tasks with precedence constraints to solicit desirable bid combinations , 2003, AAMAS '03.

[35]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[36]  Yoav Shoham,et al.  Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.

[37]  Nicholas R. Jennings,et al.  Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding , 2003, ICEC '03.

[38]  Nicholas R. Jennings,et al.  Polynomial algorithms for clearing multi-unit single-item and multi-unit combinatorial reverse auctions , 2002, ECAI.

[39]  Arne Andersson,et al.  A Multi-Commodity Market Approach to Power Load Management , 1998 .

[40]  Fredrik Ygge,et al.  Market-Oriented Programming and its Application to Power Load Management , 1998 .