Skip to main content
Springer Nature Link
Log in

An Immune Partheno-Genetic Algorithm for Winner Determination in Combinatorial Auctions

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

  • 1726 Accesses

Abstract

Combinatorial auctions are efficient mechanisms for allocating resource in complex marketplace. Winner determination, which is NP-complete, is the core problem in combinatorial auctions. This paper proposes an immune partheno-genetic algorithm (IPGA) for solving this problem. Firstly, a zero-one programming model is built for the winner determination problem with XOR-bids and OR-bids. Then, steps of constructing three partheno-genetic operators and an immune operator are introduced. In the immune operation, new heuristics are designed for vaccines selection and vaccination. Simulation results show that the IPGA achieves good performance in large size problems and the immune operator can improve the searching ability and increase the converging speed greatly.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. McAfee, R.P., McMillan, J.: Analyzing the airwaves auction. Journal Economic Perspectives 10(1), 159–175 (1996)

    Google Scholar 

  2. Rassenti, S.J., Smith, V.L., Bulfin, R.L.: A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics 13, 402–417 (1982)

    Article  Google Scholar 

  3. Hartley, J.L., Lane, M.D., Hong, Y.: An exploration of the adoption of e-auctions in supply management. IEEE Transactions on Engineering Management 51(2), 153–161 (2004)

    Article  Google Scholar 

  4. Parkes, D.C.: iBundle: An Efficient Ascending Price Bundle Auction. In: ACM Conference on Electronic Commence (EC 1999), pp. 148–157 (1999)

    Google Scholar 

  5. Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1-2), 1–54 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science 44(8), 1131–1147 (1998)

    Article  MATH  Google Scholar 

  7. Xia, M., Koehler, G.J., Whinston, A.B.: Pricing combinatorial auctions. European Journal of Operational Research 154(1), 251–270 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Sandholmm, T., Suri, S.: BOB: Improved winner determination in combinatorial auctions and generalizations. Artificial Intelligence 145(1-2), 33–58 (2003)

    Article  MathSciNet  Google Scholar 

  9. Mito, M., Fujita, S.: On heuristics for solving winner determination problem in combinatorial auctions. In: Proceedings of IAT 2003, pp. 25–31 (2003)

    Google Scholar 

  10. Leyton-Brown, K., Tennenholtz, M., Shoham, Y.: An algorithm for multi-unit combinatorial auctions. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), Austin, TX (2000)

    Google Scholar 

  11. Gonen, R., Lehmann, D.: Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics. In: Proceedings of the 2nd ACM conference on electronic commerce (2000)

    Google Scholar 

  12. Li, M.J., Tong, T.S.: A partheno-genetic algorithm and analysis on its global convergence. ACTA Automatica Sinica 25(1), 68–72 (1999)

    MathSciNet  Google Scholar 

  13. Jiao, L.C., Wang, L.: A novel genetic algorithm based on immunity. IEEE Transactions on Systems, Man and Cybernetics, Part A 30(5), 552–561 (2000)

    Article  Google Scholar 

  14. Wang, L., Pan, J., Jiao, L.C.: The immune programming. Chinese Journal of Computers (in Chinese) 23(8), 806–812 (2000)

    Google Scholar 

  15. Li, M.J., Tong, T.S.: An improved partheno-genetic algorithm for traveling salesman problem. In: Proceedings of the 4th World Congress on Intelligent Control and Automation, vol. 4, pp. 3000–3004 (2002)

    Google Scholar 

  16. Li, S.G., Wu, Z.M., Pang, X.H.: Hybrid partheno-genetic algorithm and its application in flow-shop problem. Journal of Systems Engineering and Electronics 15(1), 19–24 (2004)

    Google Scholar 

  17. Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Yurramendi, Y.: Learning Bayesian network structures by searching for the best ordering with genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics, Part A 26(4), 487–493 (1996)

    Article  Google Scholar 

  18. Bai, J.C., Chang, H.Y., Yi, Y.: A partheno-genetic algorithm for optimal winner determination in combinatorial auctions. In: Proceedings of 2004 International Conference on Machine Learning and Cybernetics, vol. 1, pp. 553–557 (2004)

    Google Scholar 

  19. Nandy, M., Mahanti, A.: An improved search technique for optimal winner determination in combinatorial auctions. In: Proceedings of the 37th Annual Hawaii International Conference, pp. 63–72 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Sun Yat-sen University, GuangZhou, 510275, PRC

    JianCong Bai, HuiYou Chang & Yang Yi

Authors
  1. JianCong Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. HuiYou Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yang Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  2. School of Software, Sun Yat-Sen University, 510275, Guangzhou, China

    Ke Chen

  3. School of Computer Engineering, Nanyang Technological University, BLK N4, 2b-39, Nanyang Avenue, 639798, Singapore

    Yew Soon Ong

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bai, J., Chang, H., Yi, Y. (2005). An Immune Partheno-Genetic Algorithm for Winner Determination in Combinatorial Auctions. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_9

Download citation

  • DOI: https://doi.org/10.1007/11539902_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation