Skip to main content
Springer Nature Link
Log in

Fast Partial Reallocation in Combinatorial Auctions for Iterative Resource Allocation

  • Conference paper
Agent Computing and Multi-Agent Systems (PRIMA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5044))

Included in the following conference series:

  • 732 Accesses

Abstract

In this paper, we propose enhanced approximation algorithms of combinatorial auction that are suitable for the purpose of periodical reallocation of items. Our algorithms are designed to effectively reuse the last solutions to speeding up initial approximation performance. We show experimental results that show our proposed algorithms outperform existing algorithms in some aspects when the existing bids are not deleted. Also, we propose an enhanced algorithm that effectively avoids undesirable reuse of last solutions in the algorithm. This is especially effective when some existing bids are deleted from the last cycle. Furthermore, our algorithms satisfy two desirable properties: WPM for final results and Weak-WPM for intermediate results.

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. Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Cabob: A fast optimal algorithm for winner determination in combinatorial auctions. Management Science 51(3), 374–390 (2005)

    Article  MATH  Google Scholar 

  2. McMillan, J.: Selling spectrum rights. The Journal of Economic Perspectives (1994)

    Google Scholar 

  3. Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2006)

    MATH  Google Scholar 

  4. Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approarches. In: Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 548–553 (1999)

    Google Scholar 

  5. Lehmann, D., O’Callaghan, L.I., Shoham, Y.: Truth revelation in rapid, approximately efficient combinatorial auctions. Journal of the ACM 49, 577–602 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Zurel, E., Nisan, N.: An efficient approximate allocation algorithm for combinatorial auctions. In: Proc. of the Third ACM Conference on Electronic Commerce (EC 2001), pp. 125–136 (2001)

    Google Scholar 

  7. Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proc. of the AAAI 2000, pp. 22–29 (2000)

    Google Scholar 

  8. Fukuta, N., Ito, T.: Towards better approximation of winner determination for combinatorial auctions with large number of bids. In: Proc. of The 2006 WIC/IEEE/ACM International Conference on Intelligent Agent Technology(IAT 2006), pp. 618–621 (2006)

    Google Scholar 

  9. Fukuta, N., Ito, T.: Short-time approximation on combinatorial auctions – a comparison on approximated winner determination algorithms. In: Proc. of The 3rd International Workshop on Data Engineering Issues in E-Commerce and Services (DEECS 2007), pp. 42–55 (June 2007)

    Google Scholar 

  10. Parkes, D.C., Cavallo, R., Elprin, N., Juda, A., Lahaie, S., Lubin, B., Michael, L., Shneidman, J., Sultan, H.: Ice: An iterative combinatorial exchange. In: The Proc. 6th ACM Conf. on Electronic Commerce (EC 2005) (2005)

    Google Scholar 

  11. Fukuta, N., Ito, T.: Periodical resource allocation using approximated combinatorial auctions. In: Proc. of The 2007 WIC/IEEE/ACM International Conference on Intelligent Agent Technology (IAT 2007) (2007)

    Google Scholar 

  12. Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proc. of EC 2000, pp. 66–76 (2000)

    Google Scholar 

  13. de Vries, S., Vohra, R.V.: Combinatorial auctions: A survey. International Transactions in Operational Research 15(3), 284–309 (2003)

    MathSciNet  MATH  Google Scholar 

  14. Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 1064–1073. ACM Press, New York (2006)

    Chapter  Google Scholar 

  15. Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 595–604 (2005)

    Google Scholar 

  16. Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: A non-exact approach and experiment studies on the combinatorial auction problem. In: Proc. of HICSS 2005, p. 82.1 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shizuoka University, Hamamatsu, Shizuoka, 4328011, Japan

    Naoki Fukuta

  2. Nagoya Institute of Technology, Gokiso-cho, Nagoya, 4668555, Japan

    Takayuki Ito

Authors
  1. Naoki Fukuta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takayuki Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Software Engineering, University of Wollongong, NSW 2522, Wollongong, Australia

    Aditya Ghose

  2. National ICT Australia, Queensland Research Laboratory, St Lucia, Queensland, Australia

    Guido Governatori

  3. Rangsit University, Bangkok, Thailand

    Ramakoti Sadananda

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fukuta, N., Ito, T. (2009). Fast Partial Reallocation in Combinatorial Auctions for Iterative Resource Allocation. In: Ghose, A., Governatori, G., Sadananda, R. (eds) Agent Computing and Multi-Agent Systems. PRIMA 2007. Lecture Notes in Computer Science(), vol 5044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01639-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01639-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01638-7

  • Online ISBN: 978-3-642-01639-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics