Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
Solving Combinatorial Auctions Using Stochastic Local Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combinatorial Auctions
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Periodical Resource Allocation Using Approximated Combinatorial Auctions
IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
An experimental analysis of biased parallel greedy approximation for combinatorial auctions
International Journal of Intelligent Information and Database Systems
Agent-based control for decentralised demand side management in the smart grid
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Toward a VCG-Like Approximate Mechanism for Large-Scale Multi-unit Combinatorial Auctions
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
CEC '11 Proceedings of the 2011 IEEE 13th Conference on Commerce and Enterprise Computing
A scoring rule-based mechanism for aggregate demand prediction in the smart grid
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
PRIMA'11 Proceedings of the 14th international conference on Agent Based Simulation for a Sustainable Society and Multi-agent Smart Computing
| Hi-index | 0.00 |
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.