Research ArticleOpen AccessGoogle Scholar indexed
Evolutionary Techniques for Reverse Auctions
Department of Computer Science, University of Regina, Regina, Canada
Department of Computer Science, University of Regina, Regina, Canada
Department of Computer Science, University of Regina, Regina, Canada
- 1 Department of Computer Science, University of Regina, Regina, Canada
- 2 Department of Computer Science, University of Regina, Regina, Canada
- 3 Department of Computer Science, University of Regina, Regina, Canada
Intelligent Control and Automation·Volume 04 (2013)·Pages 371–378·Published 13 November 2013·DOI10.4236/ica.2013.44044
Copy link · social · email
Abstract
Winner determination is one of the main challenges in combinatorial auctions. However, not much work has been done to solve this problem in the case of reverse auctions using evolutionary techniques. This has motivated us to propose an improvement of a genetic algorithm based method, we have previously proposed, to address two important issues in the context of combinatorial reverse auctions: determining the winner(s) in a reasonable processing time, and reducing the procurement cost. In order to evaluate the performance of our proposed method in practice, we conduct several experiments on combinatorial reverse auctions instances. The results we report in this paper clearly demonstrate the efficiency of our new method in terms of processing time and procurement cost.
KeywordsWinner DeterminationCombinatorial Reverse AuctionsGenetic Algorithms
- P. Patodi, A. K. Ray and M. Jenamani, “GA Based Winner Determination in Combinatorial Reverse Auction”. Proceedings of the 2nd International Conference on Emerging Applications of Information Technology, Kolkata,19-20 February 2011, pp. 361-364.
- V. Avasarala, H. Polavarapu and T. Mullen, “An Approximate Algorithm for Resource Allocation using Combinatorial Auctions,” Proceeding of the IEEE/WIC/ ACM International Conference on Intelligent Agent Technology, Hong Kong, 18-22 December 2006, pp. 571578.
- T. Mullen, V. Avasarala and D. L. Hall, “CustomerDriven Sensor Management,” IEEE Intelligent Systems, Vol. 21, No. 2, 2006, pp. 41-49. http://dx.doi.org/10.1109/MIS.2006.23
- L. Zhang and R. Zhang, “The Winner Determination Approach of Combinatorial Auctions based on Double Layer Orthogonal Multi-Agent Genetic Algorithm”, Proceedings of the 2nd IEEE Conference on Industrial Electronics and Applications, Harbin, 23-25 May 2007, pp. 2382-2386.
- A. M. Easwaran and J. Pitt, “An Agent Service Brokering Algorithm for Winner Determination in Combinatorial Auctions,” Proceedings of the 14th European Conference on Artificial Intelligence, Berlin, 20-25 August 2000, pp. 286-290.
- W. E. Walsh, M. Wellman and F. Ygge, “Combinatorial Auctions for Supply Chain Formation”, Proceeding of the ACM Conference on Electronic Commerce, 2000, pp. 260-269. http://dx.doi.org/10.1145/352871.352900
- A. Das and D. Grosu, “A Combinatorial Auction-Based Protocols for Resource Allocation in Grids,” Proceedings of the 19th IEEE International on Parallel and Distributed Processing Symposium, 4-8 April 2005. http://dx.doi.org/10.1109/IPDPS.2005.140
- V. Avasarala, T. Mullen, D. L. Hall and A. Garga, “MASM: Market Architecture or Sensor Management in Distributed Sensor Networks,” Proceeding of the SPIE Defense and Security Symposium, Vol. 5813, 2005, pp. 281-289.
- J. Gong, J. Qi, G. Xiong, H. Chen and W. Huang, “AGA Based Combinatorial Auction Algorithm for Multi-robot Cooperative Hunting,” Proceedings of theInternational Conference on Computational Intelligence and Security, Harbin, 15-19 December 2007, pp. 137-141.
- S. J. Rassenti, V. L. Smith and R. L. Bulfin, “A Combinatorial Auction Mechanism for Airport Time Slot Allocation,” The Bell Journal of Economics, RAND Corporation, Vol. 13, No. 2, 1982, pp. 402-417. http://dx.doi.org/10.2307/3003463
- Y. Narahari and P. Dayama, “Combinatorial Auctions for Electronic Business,” Sadhana, Vol. 30, No. 2-3, 2005, pp. 179-211. http://dx.doi.org/10.1007/BF02706244