Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2000: Principles and Practice of Constraint Programming – CP 2000 pp 549–553Cite as

An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1894))

Abstract

Auctions on the Internet have become especially popular in Electronic Commerce. Amongthe various studies on the Internet auctions, those on combinatorial auctions have lately attracted considerable attention. Combinatorial auctions simultaneously sell multiple items with interdependent values and allow the bidders to bid on any combination of items. Therefore, they tend to increase the buyers’ utilities and the seller’s revenue.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Fujishima, Y., Leyton-Brown, K., and Shoham, Y.: Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches. IJCAI-99 (1999)

    Google Scholar 

  2. Harvey, W. D. and Ginsberg, M. L.: Limited Discrepancy Search. IJCAI-95 (1995)

    Google Scholar 

  3. Korf, R. E.: Depth-first iterative deepening: an optimal admissible tree search. Artificial Intelligence 62 (1993) 43–78

    Article  MathSciNet  Google Scholar 

  4. Rothkopf, M. H., Pekeč, A., and Harstad, R. M.: Computationally Manageable Combinatorial Auctions. Management Science 44 (1998) 1131–1147

    Article  MATH  Google Scholar 

  5. Sandholm, T.: An Algorithm for Optimal Winner Determination in Combinatorial Auction. IJCAI-99 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT Communication Science Laboratories, 2-4 Hikaridai, Seika-cho, Soraku-gun, Kyoto, 619-0237, Japan

    Yuko Sakurai, Makoto Yokoo & Koji Kamei

Authors
  1. Yuko Sakurai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Makoto Yokoo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Koji Kamei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California at Irvine, Irvine, CA, 92697, USA

    Rina Dechter

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakurai, Y., Yokoo, M., Kamei, K. (2000). An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-45349-0_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45349-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation