Skip to main content
SpringerLink
Log in
Book cover

Pacific Rim International Conference on Multi-Agents

PRIMA 2008: Intelligent Agents and Multi-Agent Systems pp 173–184Cite as

Performance Analysis about Parallel Greedy Approximation on Combinatorial Auctions

  • Conference paper

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

Abstract

Combinatorial auctions provide suitable mechanisms for efficient allocation of resources to self-interested agents. Considering ubiquitous computing scenarios, the ability to complete an auction within a fine-grained time period without loss of allocation efficiency is in strong demand. Furthermore, to achieve such scenarios, it is very important to handle a large number of bids in an auction. Recently, we proposed an algorithm to obtain sufficient quality of winners in very short time. However, it is demanded to analyze which factor is mainly affected to obtain such a good performance. Also it is demanded to clarify the actual implementation-level performance of the algorithm compared to a major commercial-level generic problem solver. In this paper, we show our parallel greedy updating approach contributes its better performance. Furthermore, we show our approach has a certain advantage compared to a latest commercial-level implementation of generic LP solver through various experiments.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  Google Scholar 

  2. 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 

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

    Google Scholar 

  4. 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 

  5. 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 (2007)

    Google Scholar 

  6. 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), pp. 434–441 (2007)

    Google Scholar 

  7. Fukuta, N., Ito, T.: Fast partial reallocation in combinatorial auctions for iterative resource allocation. In: Proc. of 10th Pacific Rim International Workshop on Multi-Agents (PRIMA 2007), pp. 196–207 (2007)

    Google Scholar 

  8. Fukuta, N., Ito, T.: Toward a large scale e-market: A greedy and local search based winner determination. In: Okuno, H.G., Ali, M. (eds.) IEA/AIE 2007. LNCS, vol. 4570, pp. 354–363. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. 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 

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

    Google Scholar 

  11. 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 

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

    MathSciNet  MATH  Google Scholar 

  13. 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 

  14. Avasarala, V., Polavarapu, H., Mullen, T.: An approximate algorithm for resource allocation using combinatorial auctions. In: Proc. of the 2006 WIC/IEEE/ACM International Conference on Intelligent Agent Technology (IAT 2006), pp. 571–578 (2006)

    Google Scholar 

  15. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Kastner, R., Hsieh, C., Potkonjak, M., Sarrafzadeh, M.: On the sensitivity of incremental algorithms for combinatorial auctions. In: Proc. International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002), pp. 81–88 (2002)

    Google Scholar 

  18. 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 

  19. 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 

  20. 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 

  21. Boutiler, C., Goldszmidt, M., Sabata, B.: Sequential auctions for the allocation of resources with complementarities. In: Proc. of International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 527–534 (1999)

    Google Scholar 

  22. Koenig, S., Tovey, C., Zheng, X., Sungur, I.: Sequential bundle-bid single-sale auction algorithms for decentralized control. In: Proc. of International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1359–1365 (2007)

    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

  3. Massachusetts Institute of Technology, Cambridge, MA 02142, USA

    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. College of Technology, Vietnam National University, 144 Xuan Thuy, Cau Giay, Hanoi, Vietnam

    The Duy Bui  & Quang Thuy Ha  & 

  2. The Francophone Institute for Computer Science, 42 Ta Quang Buu, Hai Ba Trung, Hanoi, Vietnam

    Tuong Vinh Ho

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fukuta, N., Ito, T. (2008). Performance Analysis about Parallel Greedy Approximation on Combinatorial Auctions. In: Bui, T.D., Ho, T.V., Ha, Q.T. (eds) Intelligent Agents and Multi-Agent Systems. PRIMA 2008. Lecture Notes in Computer Science(), vol 5357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89674-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89674-6_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89673-9

  • Online ISBN: 978-3-540-89674-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation