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 to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Fujishima, Y., Leyton-Brown, K., and Shoham, Y.: Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches. IJCAI-99 (1999)
Harvey, W. D. and Ginsberg, M. L.: Limited Discrepancy Search. IJCAI-95 (1995)
Korf, R. E.: Depth-first iterative deepening: an optimal admissible tree search. Artificial Intelligence 62 (1993) 43–78
Rothkopf, M. H., Pekeč, A., and Harstad, R. M.: Computationally Manageable Combinatorial Auctions. Management Science 44 (1998) 1131–1147
Sandholm, T.: An Algorithm for Optimal Winner Determination in Combinatorial Auction. IJCAI-99 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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