Discrete quantum-behaved particle swarm optimization for the multi-unit combinatorial auction winner determination problem

Journal of Applied Sciences

Volumn 10, Issue 4, 2010, Pages 291-297

  Farzi, Saeed ^a  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

Binary search space; Combinatorial auction; Genetic algorithm; Swarm algorithm

Indexed keywords

BINARY SEARCH; COMBINATORIAL AUCTION; DISCRETE QUANTUM-BEHAVED PARTICLE SWARM OPTIMIZATIONS; MULTI-UNIT COMBINATORIAL AUCTIONS; QUANTUM-BEHAVED PARTICLE SWARM OPTIMIZATION; SWARM ALGORITHMS; SWARM INTELLIGENCE ALGORITHMS; WINNER DETERMINATION PROBLEM;

ARTIFICIAL INTELLIGENCE; COMMERCE; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); QUANTUM THEORY; TESTING;

COMBINATORIAL MATHEMATICS;

EID: 76449114577     PISSN: 18125654     EISSN: 18125662     Source Type: Journal    
DOI: 10.3923/jas.2010.291.297     Document Type: Article

References (19)

1. Fujishima, Y., K. Leyton-Brown and Y. Shoham, 1999. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. Proceedings of the 16th International Joint Conference on Artificial Intelligence, July 31-Aug. 06, Stockholm, Morgan Kaufmann Publishers Inc. San Francisco, pp: 548-553.
2. Gonen, R. and D. Lehmann, 2000. Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics. Proceedings of the 2nd ACM Conference on Electronic Commerce, Oct. 17-20, ACM, New York, USA., pp: 13-20.
3. Hoos, H. and C. Boutilier, 2000. Solving combinatorial auctions using stochastic local search. Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, July 30-Aug. 03, AAAI Press/The MIT Press, pp: 22-29.
4. Kennedy, J. and R. Eberhart, 1995. Particle swarm optimization. Proc. IEEE Int. Conf. Neural Networks, 4: 1942-1948.
5. Kennedy, J. and R.C. Eberhart, 1997. A discrete binary version of the particles swarm algorithm. Proceedings of IEEE International Conference on Systems, Man and Cybernetics, Oct. 12-15, Orlando, FL, USA., pp: 4104-4108.
6. Lehmann, D., L.I. O'Callaghan and Y. Shoham, 1990. Truth revelation in rapid, approximately efficient combinatorial auction. J. Econ., 13: 12-17.
7. Leyton-Brown, K., M. Tennenholtz and Y. Shoham, 2000. An algorithm for multi-unit combinatorial auctions. Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, July 30-Aug. 03, MIT Press, pp: 56-61.
8. Mito, M. and S. Fujita, 2003. On heuristics for solving winner determination problem in combinatorial auctions. Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology, Oct. 13-17, IEEE Computer Society, Washington, DC, USA., pp: 25-31.
9. Nisan, N., 2000. Bidding and allocation in combinatorial auctions. Proceedings of the 2nd ACM Conference on Electronic Commerce, Oct. 17-20, ACM, New York, pp: 1-12.
10. Rassenti, S.J., V.L. Smith and R.L. Bulfin, 1982. A combinatorial auction mechanism for airport time slot allocation. Bell J. Econ., 13: 402-417.
11. Rothkopf, M.H., A. Pekec and R.M. Harstad, 1998. Computationally manageable combinatorial auctions. Manage. Sci., 44: 1131-1147.
12. Sandholm, T. and S. Suri, 2002. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. Assoc. Adva. Artif. Intel., 1: 90-97.
13. Sandholm, T., 2002. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intell., 135: 1-54.
14. Sun, J., B. Feng and W. Xu, 2004. Particle Swarm optimization with particles having quantum behavior. Proceedings of Congress on Evolutionary Computation, June 19-23, Harbin, pp: 325-331.
15. Sun, J., W. Xu and J. Liu, 2005. Parameter Selection of Quantum-Behaved Particle Swarm Optimization. In: Advances in Natural Computation, Wang, L., K. Chen and Y.S. Ong (Eds.). LNCS. 3612, Springer-Verlag, Berlin, Heidelberg, ISBN: 978-3-540-28320-1, pp: 543-552.
16. Sun, J., W.B. Xu and B. Feng, 2004. A Global search strategy of quantum-behaved particle swarm optimization. Proceedings of 2004 IEEE Conference on Cybernetics and Intelligent Systems, Oct. 10-13, Singapore, pp: 111-116.
17. Xia, M., G.J. Koehler and A.B. Whinston, 2004. Pricing combinatorial auctions. Eur. J. Operat. Res., 154: 251-270.
18. Zhang, L. and R. Zhang, 2007. The winner determination approach of combinatorial auctions based on double layer orthogonal multi-agent genetic algorithm. Proceedings of 2nd IEEE Conference on Industrial Electronics and Applications, Harbin, May 23-25, IEEE Computer Society Press, USA., pp: 2382-2386.
19. Zhou, D., J. Sun and W. Xu, 2007. Polygonal approximation of curves using binary quantum-behaved particle swarm optimization. J. Comput. Appl., 27: 2030-2032.