A Preliminary Experimental Analysis on Combinatorial Auction-Based Electric Power Allocation for Manufacturing Industries

In this paper, we discuss about a preliminary idea and an analysis about a dynamic electric power auction for manufacturing industries. We present a preliminary idea about applying multi-unit combinatorial auctions to an electric power allocation problem that considers guaranteeing stable continuous use of the supplied power in industrial manufacturers. We try to illustrate how such a mechanism can be applied to actual electric power allocation problems when we consider the situation that each manufacturing factories produce bids based on their own plans of production and the use of electricity in a day, guaranteeing stable continuous use of them. An approximation mechanism has been applied for a large-scale auction problem to overcome its computational intractability. We discuss about a possible performance based on our proposed evaluation dataset which consider actual power use scenarios in industrial factories.

[1]  Fukuta Naoki.  An Approach to VCG-like Approximate Allocation and Pricing for Large-scale Multi-unit Combinatorial Auctions (エージェントの理論とその応用) -- (知識コミュニティ) , 2012 .

[2]  Alex Rogers,et al.  A scoring rule-based mechanism for aggregate demand prediction in the smart grid , 2012, AAMAS.

[3]  Takayuki Ito,et al.  An Approach to Sustainable Electric Power Allocation Using a Multi-round Multi-unit Combinatorial Auction , 2011, PRIMA Workshops.

[4]  Takayuki Ito,et al.  Toward Combinatorial Auction-based Better Electric Power Allocation on Sustainable Electric Power Systems , 2011, 2011 IEEE 13th Conference on Commerce and Enterprise Computing.

[5]  Naoki Fukuta,et al.  Toward a VCG-Like Approximate Mechanism for Large-Scale Multi-unit Combinatorial Auctions , 2011, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.

[6]  Sarvapali D. Ramchurn,et al.  Agent-based control for decentralised demand side management in the smart grid , 2011, AAMAS.

[7]  Takayuki Ito,et al.  An experimental analysis of biased parallel greedy approximation for combinatorial auctions , 2010, Int. J. Intell. Inf. Database Syst..

[8]  D. MacIsaac.  Sustainable Energy — Without the hot air , 2009 .

[9]  Takayuki Ito,et al.  Periodical Resource Allocation Using Approximated Combinatorial Auctions , 2007, 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07).

[10]  W. Drozd.  Automatically Defined Swarms for Task Allocation , 2007, IAT.

[11]  Takayuki Ito,et al.  Towards Better Approximation of Winner Determination for Combinatorial Auctions with Large Number of Bids , 2006, 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[12]  Jan T. Bialasiewicz,et al.  Power-Electronic Systems for the Grid Integration of Renewable Energy Sources: A Survey , 2006, IEEE Transactions on Industrial Electronics.

[13]  Yoav Shoham,et al.  Combinatorial Auctions , 2005 .

[14]  David Levine,et al.  CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions , 2005, Manag. Sci..

[15]  Y. Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, JACM.

[16]  Noam Nisan,et al.  An efficient approximate allocation algorithm for combinatorial auctions , 2001, EC '01.

[17]  Yoav Shoham,et al.  Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.

[18]  Noam Nisan,et al.  Computationally feasible VCG mechanisms , 2000, EC '00.

[19]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.

[20]  J. Mcmillan.  Selling Spectrum Rights , 1994 .

[21]  Naoki Fukuta,et al.  An Approach to VCG-like Approximate Allocation and Pricing for Large-scale Multi-unit Combinatorial Auctions , 2013, J. Inf. Process..

[22]  Takayuki Ito,et al.  Fine-grained efficient resource allocation using approximated combinatorial auctionsA parallel greedy winner approximation for large-scale problems , 2009, Web Intell. Agent Syst..